TY - CHAP A1 - Coconu, Liviu A1 - Ullmer, Brygg A1 - Paar, Philip A1 - Liu, Jing A1 - Konkel, Miriam A1 - Hege, Hans-Christian T1 - A smartphone-based tangible interaction approach for landscape visualization. T2 - PerDis ’18 Proceedings of the 7th ACM International Symposium on Pervasive Displays, Munich, Germany, June 6-8, 2018 N2 - The use of tangible interfaces for navigation of landscape scenery – for example, lost places re-created in 3D – has been pursued and articulated as a promising, impactful application of interactive visualization. In this demonstration, we present a modern, low-cost implementation of a previously-realized multimodal gallery installation. Our demonstration centers upon the versatile usage of a smartphone for sensing, navigating, and (optionally) displaying element on a physical surface in tandem with a larger, more immersive display. Y1 - 2018 U6 - https://doi.org/10.1145/3205873.3210707 SP - no. 23 PB - ACM CY - New York, NY, USA ER - TY - CHAP A1 - Ullmer, Brygg A1 - Paar, Philip A1 - Coconu, Liviu A1 - Liu, Jing A1 - Konkel, Miriam A1 - Hege, Hans-Christian T1 - An 1834 mediterranean garden in Berlin – engaged from 2004, 2018, 2032, and 2202 T2 - PerDis ’18 – 7th ACM International Symposium on Pervasive Displays, Munich, Germany, June 6-8, 2018 N2 - In 2004, a team of researchers realized a semi-immersive interactive gallery installation, visualizing an 1834 Mediterranean garden, introduced as “italienisches Kunststück” (Italian legerdemain) by Peter Joseph Lenné. The park was originally realized on the grounds of Schloss Sanssouci in Potsdam, Germany. The installation centered on highly detailed renderings of hundreds of plants projected upon a panoramic display. Interactivity was expressed with a tangible interface which (while presently dated) we believe remains without near-precedent then or since. We present the installation (experienced by roughly 20,000 visitors), focusing on the interaction aspects. We introduce new book and table/door-format mockups. Drawing upon a heuristic of the scientist-philosopher Freeman Dyson, we consider grounded future prospect variations in the contexts of 2018, 2032, and 2202. We see this exercise as prospectively generalizing to a variety of similar and widely diverse application domains. Y1 - 2018 U6 - https://doi.org/10.1145/3205873.3205894 SP - no. 12 PB - ACM CY - New York, NY, USA ER - TY - GEN A1 - Baum, Daniel A1 - Lindow, Norbert A1 - Hege, Hans-Christian A1 - Lepper, Verena A1 - Siopi, Tzulia A1 - Kutz, Frank A1 - Mahlow, Kristin A1 - Mahnke, Heinz-Eberhard T1 - Revealing hidden text in rolled and folded papyri N2 - Ancient Egyptian papyri are often folded, rolled up or kept as small packages, sometimes even sealed. Physically unrolling or unfolding these packages might severely damage them. We demonstrate a way to get access to the hidden script without physical unfolding by employing computed tomography and mathematical algorithms for virtual unrolling and unfolding. Our algorithmic approaches are combined with manual interaction. This provides the necessary flexibility to enable the unfolding of even complicated and partly damaged papyrus packages. In addition, it allows us to cope with challenges posed by the structure of ancient papyrus, which is rather irregular, compared to other writing substrates like metallic foils or parchment. Unfolding of packages is done in two stages. In the first stage, we virtually invert the physical folding process step by step until the partially unfolded package is topologically equivalent to a scroll or a papyrus sheet folded only along one fold line. To minimize distortions at this stage, we apply the method of moving least squares. In the second stage, the papyrus is simply flattened, which requires the definition of a medial surface. We have applied our software framework to several papyri. In this work, we present the results of applying our approaches to mockup papyri that were either rolled or folded along perpendicular fold lines. In the case of the folded papyrus, our approach represents the first attempt to address the unfolding of such complicated folds. T3 - ZIB-Report - 17-02 KW - unfolding, papyri, computed tomography Y1 - 2017 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-61826 SN - 1438-0064 ER - TY - GEN A1 - Costa, Marta A1 - Manton, James D. A1 - Ostrovsky, Aaron D. A1 - Prohaska, Steffen A1 - Jefferis, Gregory S.X.E. T1 - NBLAST: Rapid, sensitive comparison of neuronal structure and construction of neuron family databases N2 - Neural circuit mapping is generating datasets of 10,000s of labeled neurons. New computational tools are needed to search and organize these data. We present NBLAST, a sensitive and rapid algorithm, for measuring pairwise neuronal similarity. NBLAST considers both position and local geometry, decomposing neurons into short segments; matched segments are scored using a probabilistic scoring matrix defined by statistics of matches and non-matches. We validated NBLAST on a published dataset of 16,129 single Drosophila neurons. NBLAST can distinguish neuronal types down to the finest level (single identified neurons) without a priori information. Cluster analysis of extensively studied neuronal classes identified new types and unreported topographical features. Fully automated clustering organized the validation dataset into 1052 clusters, many of which map onto previously described neuronal types. NBLAST supports additional query types including searching neurons against transgene expression patterns. Finally we show that NBLAST is effective with data from other invertebrates and zebrafish. T3 - ZIB-Report - 16-34 KW - neuroinformatics KW - NBLAST KW - neuron similarity KW - cell type KW - clustering Y1 - 2016 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-59672 SN - 1438-0064 ER - TY - JOUR A1 - Costa, Marta A1 - Manton, James D. A1 - Ostrovsky, Aaron D. A1 - Prohaska, Steffen A1 - Jefferis, Gregory S.X.E. T1 - NBLAST: Rapid, Sensitive Comparison of Neuronal Structure and Construction of Neuron Family Databases JF - Neuron N2 - Neural circuit mapping is generating datasets of tens of thousands of labeled neurons. New computational tools are needed to search and organize these data. We present NBLAST, a sensitive and rapid algorithm, for measuring pairwise neuronal similarity. NBLAST considers both position and local geometry, decomposing neurons into short segments; matched segments are scored using a probabilistic scoring matrix defined by statistics of matches and non-matches. We validated NBLAST on a published dataset of 16,129 single Drosophila neurons. NBLAST can distinguish neuronal types down to the finest level (single identified neurons) without a priori information. Cluster analysis of extensively studied neuronal classes identified new types and unreported topographical features. Fully automated clustering organized the validation dataset into 1,052 clusters, many of which map onto previously described neuronal types. NBLAST supports additional query types, including searching neurons against transgene expression patterns. Finally, we show that NBLAST is effective with data from other invertebrates and zebrafish. Y1 - 2016 U6 - https://doi.org/10.1016/j.neuron.2016.06.012 VL - 91 IS - 2 SP - 293 EP - 311 ER - TY - CHAP A1 - Dennstedt, Anne A1 - Gaslain, Fabrice A1 - Bartsch, Marion A1 - Guipont, Vincent A1 - Maurel, Vincent T1 - Crack Morphology in a Columnar Thermal Barrier Coating System N2 - Ceramic layers are used as thermal barrier coatings (TBCs) on metallic substrates. During thermal transients, the thermal expansion mismatch between coating and substrate drives failure of the TBC mainly by interfacial cracking. Laser Shock Adhesion Test (LASAT) provides stresses at the ceramic/metal interface enabling controlled interfacial cracking. For achieving a clear understanding of the influence of local morphology on interfacial toughness, this study aims at characterizing the 3D morphology of a crack at the interface between metal and an EB-PVD TBC having a columnar structure. Cracks were produced by LASAT and documented further in SE and BSE image stacks collected simultaneously during subsequent slice and view operations using a focus ion beam (FIB) and a scanning electron microscope (FIB slice & view). The segmented 3D data gives clear understanding of the columnar structure of the ceramic and of the interaction between the crack and the TBC microstructure. Y1 - 2018 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-69385 ER - TY - JOUR A1 - Nyakatura, John A1 - Baumgarten, Roxane A1 - Baum, Daniel A1 - Stark, Heiko A1 - Youlatos, Dionisios T1 - Muscle internal structure revealed by contrast-enhanced μCT and fibre recognition: The hindlimb extensors of an arboreal and a fossorial squirrel JF - Mammalian Biology N2 - In individuals of similar body mass representing closely related species with different lifestyles, muscle architectural properties can be assumed to reflect adaptation to differing, lifestyle-related functional demands. We here employ a fiber recognition algorithm on contrast-enhanced micro-computed tomography (μCT) scans of one specimen each of an arboreal (Sciurus vulgaris) and a fossorial (Spermophilus citellus) sciuromorph rodent. The automated approach accounts for potential heterogeneity of architectural properties within a muscle by analyzing all fascicles that compose a muscle. Muscle architectural properties (volume, fascicle length, and orientation, and force-generating capacity) were quantified in 14 hindlimb (hip, knee, and ankle) extensor muscles and compared between specimens. We expected the arboreal squirrel to exhibit greater force-generating capacity and a greater capacity for length change allowing more powerful hindlimb extension. Generally and mostly matching our expectations, the S. vulgaris specimen had absolutely and relatively larger extensor muscles than the S. citellus specimen which were thus metabolically more expensive and demonstrate the relatively larger investment into powerful hindlimb extension necessary in the arboreal context. We conclude that detailed quantitative data on hindlimb muscle internal structure as was gathered here for a very limited sample further lends support to the notion that muscle architecture reflects adaptation to differential functional demands in closely related species with different locomotor behaviors and lifestyles. Y1 - 2019 U6 - https://doi.org/10.1016/j.mambio.2019.10.007 VL - 99 SP - 71 EP - 80 ER - TY - JOUR A1 - Banyassady, Bahareh A1 - Chiu, Man-Kwun A1 - Korman, Matias A1 - Mulzer, Wolfgang A1 - van Renssen, André A1 - Roeloffzen, Marcel A1 - Seiferth, Paul A1 - Stein, Yannik A1 - Vogtenhuber, Birgit A1 - Willert, Max T1 - Routing in polygonal domains JF - Computational Geometry, Theory and Applications N2 - We consider the problem of routing a data packet through the visibility graph of a polygonal domain P with n vertices and h holes. We may preprocess P to obtain a "label" and a "routing table" for each vertex of P. Then, we must be able to route a data packet between any two vertices p and q of P, where each step must use only the label of the target node q and the routing table of the current node. For any fixed epsilon > 0, we present a routing scheme that always achieves a routing path whose length exceeds the shortest path by a factor of at most 1 + epsilon. The labels have O(log n) bits, and the routing tables are of size O(((epsilon^-1)+h)log n). The preprocessing time is O((n^2)log n). It can be improved to O(n^2) for simple polygons. Y1 - 2019 U6 - https://doi.org/10.1016/j.comgeo.2019.101593 VL - 87 PB - Elsevier ER - TY - JOUR A1 - Banyassady, Bahareh A1 - Barba, Luis A1 - Mulzer, Wolfgang T1 - Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees JF - Journal of Computational Geometry (JoCG) N2 - We present time-space trade-offs for computing the Euclidean minimum spanning tree of a set S of n point-sites in the plane. More precisely, we assume that S resides in a random-access memory that can only be read. The edges of the Euclidean minimum spanning tree EMST(S) have to be reported sequentially, and they cannot be accessed or modified afterwards. There is a parameter s in {1, ..., n} so that the algorithm may use O(s) cells of read-write memory (called the workspace) for its computations. Our goal is to find an algorithm that has the best possible running time for any given s between 1 and n. We show how to compute EMST(S) in O(((n^3)/(s^2)) log s) time with O(s) cells of workspace, giving a smooth trade-off between the two best-known bounds O(n^3) for s = 1 and O(n log n) for s = n. For this, we run Kruskal's algorithm on the "relative neighborhood graph" (RNG) of S. It is a classic fact that the minimum spanning tree of RNG(S) is exactly EMST(S). To implement Kruskal's algorithm with O(s) cells of workspace, we define s-nets, a compact representation of planar graphs. This allows us to efficiently maintain and update the components of the current minimum spanning forest as the edges are being inserted. Y1 - 2020 U6 - http://nbn-resolving.de/urn/resolver.pl?https://jocg.org/index.php/jocg/article/view/473 VL - 11(1) SP - 525 EP - 547 ER - TY - JOUR A1 - Willsch, Maraike A1 - Friedrich, Frank A1 - Baum, Daniel A1 - Jurisch, Ivo A1 - Ohl, Michael T1 - A comparative description of the mesosomal musculature in Sphecidae and Ampulicidae (Hymenoptera, Apoidea) using 3D techniques JF - Deutsche Entomologische Zeitschrift N2 - Conflicting hypotheses about the relationships among the major lineages of aculeate Hymenoptera clearly show the necessity of detailed comparative morphological studies. Using micro-computed tomography and 3D reconstructions, the skeletal musculature of the meso- and metathorax and the first and second abdominal segment in Apoidea are described. Females of Sceliphron destillatorium, Sphex (Fernaldina) lucae (both Sphecidae), and Ampulex compressa (Ampulicidae) were examined. The morphological terminology provided by the Hymenoptera Anatomy Ontology is used. Up to 42 muscles were found. The three species differ in certain numerical and structural aspects. Ampulicidae differs significantly from Sphecidae in the metathorax and the anterior abdomen. The metapleural apodeme and paracoxal ridge are weakly developed in Ampulicidae, which affect some muscular structures. Furthermore, the muscles that insert on the coxae and trochanters are broader and longer in Ampulicidae. A conspicuous characteristic of Sphecidae is the absence of the metaphragma. Overall, we identified four hitherto unrecognized muscles. Our work suggests additional investigations on structures discussed in this paper. Y1 - 2020 U6 - https://doi.org/10.3897/dez.67.49493 VL - 67 IS - 1 SP - 51 EP - 67 ER - TY - GEN A1 - Ege, Yannic A1 - Foth, Christian A1 - Baum, Daniel A1 - Wirkner, Christian S. A1 - Richter, Stefan T1 - Making spherical-harmonics-based Geometric Morphometrics (SPHARM) approachable for 3D images containing large cavity openings using Ambient Occlusion - a study using hermit crab claw shape variability N2 - An advantageous property of mesh-based geometric morphometrics (GM) towards landmark-based approaches, is the possibility of precisely examining highly irregular shapes and highly topographic surfaces. In case of spherical-harmonics-based GM the main requirement is a completely closed mesh surface, which often is not given, especially when dealing with natural objects. Here we present a methodological workflow to prepare 3D segmentations containing large cavity openings for the conduction of spherical-harmonics-based GM. This will be exemplified with a case study on claws of hermit crabs (Paguroidea, Decapoda, Crustacea), whereby joint openings – between manus and “movable finger” – typify the large-cavity-opening problem. We found a methodology including an ambient-occlusion-based segmentation algorithm leading to results precise and suitable to study the inter- and intraspecific differences in shape of hermit crab claws. Statistical analyses showed a significant separation between all examined diogenid and pagurid claws, whereas the separation between all left and right claws did not show significance. Additionally, the procedure offers other benefits. It is easy to reproduce and creates sparse variance in the data, closures integrate smoothly into the total structures and the algorithm saves a significant amount of time. T3 - ZIB-Report - 20-09 Y1 - 2020 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-77744 SN - 1438-0064 ER - TY - CHAP A1 - Allen, Gabrielle A1 - Dramlitsch, Thomas A1 - Goodale, Tom A1 - Lanfermann, Gerd A1 - Radke, Thomas A1 - Seidel, Edward A1 - Kielmann, Thilo A1 - Verstoep, Kees A1 - Balaton, Zoltán A1 - Kacsuk, Péter A1 - Szalai, Ferenc A1 - Gehring, Jörn A1 - Keller, Axel A1 - Streit, Achim A1 - Matyska, Ludek A1 - Ruda, Miroslav A1 - Krenek, Ales A1 - Knipp, Harald A1 - Merzky, André A1 - Reinefeld, Alexander A1 - Schintke, Florian A1 - Ludwiczak, Bogdan A1 - Nabrzyski, Jarek A1 - Pukacki, Juliusz A1 - Kersken, Hans-Peter A1 - Aloisio, Giovanni A1 - Cafaro, Massimo A1 - Ziegler, Wolfgang A1 - Russell, Michael T1 - Early experiences with the EGrid testbed T2 - Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid Y1 - 2001 U6 - https://doi.org/10.1109/CCGRID.2001.923185 SP - 130 EP - 137 ER - TY - JOUR A1 - Soares, Ana Prates A1 - Baum, Daniel A1 - Hesse, Bernhard A1 - Kupsch, Andreas A1 - Müller, Bernd A1 - Zaslansky, Paul T1 - Scattering and phase-contrast X-ray methods reveal damage to glass fibers in endodontic posts following dental bur trimming JF - Dental Materials Y1 - 2020 U6 - https://doi.org/10.1016/j.dental.2020.10.018 VL - 37 IS - 2 SP - 201 EP - 211 ER - TY - JOUR A1 - Rath, Barbara A1 - Conrad, Tim A1 - Myles, Puja A1 - Alchikh, Maren A1 - Ma, Xiaolin A1 - Hoppe, Christian A1 - Tief, Franziska A1 - Chen, Xi A1 - Obermeier, Patrick A1 - Kisler, Bron A1 - Schweiger, Brunhilde T1 - Influenza and other respiratory viruses: standardizing disease severity in surveillance and clinical trials JF - Expert Review of Anti-infective Therapy N2 - Introduction: Influenza-Like Illness is a leading cause of hospitalization in children. Disease burden due to influenza and other respiratory viral infections is reported on a population level, but clinical scores measuring individual changes in disease severity are urgently needed. Areas covered: We present a composite clinical score allowing individual patient data analyses of disease severity based on systematic literature review and WHO-criteria for uncomplicated and complicated disease. The 22-item ViVI Disease Severity Score showed a normal distribution in a pediatric cohort of 6073 children aged 0–18 years (mean age 3.13; S.D. 3.89; range: 0 to 18.79). Expert commentary: The ViVI Score was correlated with risk of antibiotic use as well as need for hospitalization and intensive care. The ViVI Score was used to track children with influenza, respiratory syncytial virus, human metapneumovirus, human rhinovirus, and adenovirus infections and is fully compliant with regulatory data standards. The ViVI Disease Severity Score mobile application allows physicians to measure disease severity at the point-of care thereby taking clinical trials to the next level. KW - Disease severity KW - influenza-like illness KW - influenza KW - respiratory syncytial virus KW - human metapneumovirus KW - human rhinovirus KW - adenovirus KW - seasonality KW - antivirals KW - clinical trials Y1 - 2017 U6 - https://doi.org/10.1080/14787210.2017.1295847 VL - 15 IS - 6 SP - 545 EP - 568 ER - TY - JOUR A1 - Shao, Borong A1 - Cannistraci, Carlo Vittorio A1 - Conrad, Tim T1 - Epithelial Mesenchymal Transition Network-Based Feature Engineering in Lung Adenocarcinoma Prognosis Prediction Using Multiple Omic Data JF - Genomics and Computational Biology N2 - Epithelial mesenchymal transition (EMT) process has been shown as highly relevant to cancer prognosis. However, although different biological network-based biomarker identification methods have been proposed to predict cancer prognosis, EMT network has not been directly used for this purpose. In this study, we constructed an EMT regulatory network consisting of 87 molecules and tried to select features that are useful for prognosis prediction in Lung Adenocarcinoma (LUAD). To incorporate multiple molecular profiles, we obtained four types of molecular data including mRNA-Seq, copy number alteration (CNA), DNA methylation, and miRNA-Seq data from The Cancer Genome Atlas. The data were mapped to the EMT network in three alternative ways: mRNA-Seq and miRNA-Seq, DNA methylation, and CNA and miRNA-Seq. Each mapping was employed to extract five different sets of features using discretization and network-based biomarker identification methods. Each feature set was then used to predict prognosis with SVM and logistic regression classifiers. We measured the prediction accuracy with AUC and AUPR values using 10 times 10-fold cross validation. For a more comprehensive evaluation, we also measured the prediction accuracies of clinical features, EMT plus clinical features, randomly picked 87 molecules from each data mapping, and using all molecules from each data type. Counter-intuitively, EMT features do not always outperform randomly selected features and the prediction accuracies of the five feature sets are mostly not significantly different. Clinical features are shown to give the highest prediction accuracies. In addition, the prediction accuracies of both EMT features and random features are comparable as using all features (more than 17,000) from each data type. Y1 - 2017 U6 - https://doi.org/10.18547/gcb.2017.vol3.iss3.e57 VL - 3 IS - 3 SP - e57 ER - TY - JOUR A1 - Jayrannejad, Fahrnaz A1 - Conrad, Tim T1 - Better Interpretable Models for Proteomics Data Analysis Using rule-based Mining JF - Springer Lecture Notes in Artificial Intelligence N2 - Recent advances in -omics technology has yielded in large data-sets in many areas of biology, such as mass spectrometry based proteomics. However, analyzing this data is still a challenging task mainly due to the very high dimensionality and high noise content of the data. One of the main objectives of the analysis is the identification of relevant patterns (or features) which can be used for classification of new samples to healthy or diseased. So, a method is required to find easily interpretable models from this data. To gain the above mentioned goal, we have adapted the disjunctive association rule mining algorithm, TitanicOR, to identify emerging patterns from our mass spectrometry proteomics data-sets. Comparison to five state-of-the-art methods shows that our method is advantageous them in terms of identifying the inter-dependency between the features and the TP-rate and precision of the features selected. We further demonstrate the applicability of our algorithm to one previously published clinical data-set. Y1 - 2017 ER - TY - JOUR A1 - Marzban, Forough A1 - Conrad, Tim A1 - Marban, Pouria A1 - Sodoudi, Sahar T1 - Estimation of the Near-Surface Air Temperature during the Day and Nighttime from MODIS in Berlin, Germany JF - International Journal of Advanced Remote Sensing and GIS N2 - Air temperature (Tair or T2m) is an important climatological variable for forest biosphere processes and climate change research. Due to the low density and the uneven distribution of weather stations, traditional ground-based observations cannot accurately capture the spatial distribution of Tair. In this study, Tair in Berlin is estimated during the day and night time over six land cover/land use (LC/LU) types by satellite remote sensing data over a large domain and a relatively long period (7 years). Aqua and Terra MODIS (Moderate Resolution Imaging Spectroradiometer) data and meteorological data for the period from 2007 to 2013 were collected to estimate Tair. Twelve environmental variables (land surface temperature (LST), normalized difference vegetation index (NDVI), Julian day, latitude, longitude, Emissivity31, Emissivity32, altitude, albedo, wind speed, wind direction and air pressure) were selected as predictors. Moreover, a comparison between LST from MODIS Terra and Aqua with daytime and night time air temperatures (Tday, Tnight) was done respectively and in addition, the spatial variability of LST and Tair relationship by applying a varying window size on the MODIS LST grid was examined. An analysis of the relationship between the observed Tair and the spatially averaged remotely sensed LST, indicated that 3 × 3 and 1 × 1 pixel size was the optimal window size for the statistical model estimating Tair from MODIS data during the day and night time, respectively. Three supervised learning methods (Adaptive Neuro Fuzzy Inference system (ANFIS), Artificial Neural Network (ANN) and Support vector machine (SVR)) were used to estimate Tair during the day and night time, and their performances were validated by cross-validation for each LC/LU. Moreover, tuning the hyper parameters of some models like SVR and ANN were investigated. For tuning the hyper parameters of SVR, Simulated Annealing (SA) was applied (SA-SVR model) and a multiple-layer feed-forward (MLF) neural networks with three layers and different nodes in hidden layers are used with Levenber-Marquardt back-propagation (LM-BP), in order to achieve higher accuracy in the estimation of Tair. Results indicated that the ANN model achieved better accuracy (RMSE= 2.16°C, MAE = 1.69°C, R2 = 0.95) than SA_SVR model (RMSE= 2.50°C, MAE = 1.92°C, R2 = 0.91) and ANFIS model (RMSE= 2.88°C, MAE= 2.2°C, R2 = 0.89) over six LC/LU during the day and night time. The Q-Q diagram of SA-SVR, ANFIS and NN show that all three models slightly tended to underestimate and overestimate the extreme and low temperatures for all LC/LU classes during the day and night time. The weak performance in the extreme and low temperatures are a consequence of the small number of data in these temperatures. These satisfactory results indicate that this approach is proper for estimating air temperature and spatial window size is an important factor that should be considered in the estimation of air temperature. KW - ANFIS KW - ANN KW - Cross-validation KW - MODIS KW - Simulated annealing KW - SVR Y1 - 2018 U6 - https://doi.org/10.23953/cloud.ijarsg.337 VL - 7 IS - 1 SP - 2478 EP - 2517 ER - TY - JOUR A1 - Kork, F. A1 - Conrad, Tim A1 - Weiss, B. A1 - Roenneberg, T. A1 - Wernecke, K.-D. A1 - Balzer, Felix T1 - Associations of postoperative mortality with the time of day, week and year JF - Anaesthesia Y1 - 2018 SN - 0959-2962 VL - 73 IS - 6 SP - 711 EP - 718 ER - TY - CHAP A1 - Fröhler, Bernhard A1 - da Cunha Melo, Lucas A1 - Weissenböck, Johannes A1 - Kastner, Johann A1 - Möller, Torsten A1 - Hege, Hans-Christian A1 - Gröller, Eduard M. A1 - Sanctorum, Jonathan A1 - De Beenhouwer, Jan A1 - Sijbers, Jan A1 - Heinzl, Christoph T1 - Tools for the analysis of datasets from X-ray computed tomography based on Talbot-Lau grating interferometry T2 - Proceedings of iCT 2019, (9th Conference on Industrial Computed Tomography, Padova, Italy – iCT 2019, February 13-15, 2019) N2 - This work introduces methods for analyzing the three imaging modalities delivered by Talbot-Lau grating interferometry X-ray computed tomography (TLGI-XCT). The first problem we address is providing a quick way to show a fusion of all three modal- ities. For this purpose the tri-modal transfer function widget is introduced. The widget controls a mixing function that uses the output of the transfer functions of all three modalities, allowing the user to create one customized fused image. A second problem prevalent in processing TLGI-XCT data is a lack of tools for analyzing the segmentation process of such multimodal data. We address this by providing methods for computing three types of uncertainty: From probabilistic segmentation algorithms, from the voxel neighborhoods as well as from a collection of results. We furthermore introduce a linked views interface to explore this data. The techniques are evaluated on a TLGI-XCT scan of a carbon-fiber reinforced dataset with impact damage. We show that the transfer function widget accelerates and facilitates the exploration of this dataset, while the uncertainty analysis methods give insights into how to tweak and improve segmentation algorithms for more suitable results. Y1 - 2019 N1 - PDF | open access: https://www.ndt.net/article/ctc2019/papers/iCT2019_Full_paper_52.pdf IS - paper 52 ER - TY - JOUR A1 - Goubergrits, Leonid A1 - Hellmeier, Florian A1 - Bruening, Jan Joris A1 - Spuler, Andreas A1 - Hege, Hans-Christian A1 - Voss, Samuel A1 - Janiga, Gábor A1 - Saalfeld, Sylvia A1 - Beuing, Oliver A1 - Berg, Philipp T1 - Multiple Aneurysms AnaTomy CHallenge 2018 (MATCH): Uncertainty Quantification of Geometric Rupture Risk Parameters JF - BioMedical Engineering OnLine N2 - Background Geometric parameters have been proposed for prediction of cerebral aneurysm rupture risk. Predicting the rupture risk for incidentally detected unruptured aneurysms could help clinicians in their treatment decision. However, assessment of geometric parameters depends on several factors, including the spatial resolution of the imaging modality used and the chosen reconstruction procedure. The aim of this study was to investigate the uncertainty of a variety of previously proposed geometric parameters for rupture risk assessment, caused by variability of reconstruction procedures. Materials 26 research groups provided segmentations and surface reconstructions of five cerebral aneurysms as part of the Multiple Aneurysms AnaTomy CHallenge (MATCH) 2018. 40 dimensional and non-dimensional geometric parameters, describing aneurysm size, neck size, and irregularity of aneurysm shape, were computed. The medians as well as the absolute and relative uncertainties of the parameters were calculated. Additionally, linear regression analysis was performed on the absolute uncertainties and the median parameter values. Results A large variability of relative uncertainties in the range between 3.9 and 179.8% was found. Linear regression analysis indicates that some parameters capture similar geometric aspects. The lowest uncertainties < 6% were found for the non-dimensional parameters isoperimetric ratio, convexity ratio, and ellipticity index. Uncertainty of 2D and 3D size parameters was significantly higher than uncertainty of 1D parameters. The most extreme uncertainties > 80% were found for some curvature parameters. Conclusions Uncertainty analysis is essential on the road to clinical translation and use of rupture risk prediction models. Uncertainty quantification of geometric rupture risk parameters provided by this study may help support development of future rupture risk prediction models. Y1 - 2019 U6 - https://doi.org/10.1186/s12938-019-0657-y VL - 18 IS - 35 ER - TY - JOUR A1 - Fröhler, Bernhard A1 - Elberfeld, Tim A1 - Möller, Torsten A1 - Hege, Hans-Christian A1 - Weissenböck, Johannes A1 - De Beenhouwer, Jan A1 - Sijbers, Jan A1 - Kastner, Johann A1 - Heinzl, Christoph T1 - A Visual Tool for the Analysis of Algorithms for Tomographic Fiber Reconstruction in Materials Science JF - Computer Graphics Forum N2 - We present visual analysis methods for the evaluation of tomographic fiber reconstruction algorithms by means of analysis, visual debugging and comparison of reconstructed fibers in materials science. The methods are integrated in a tool (FIAKER) that supports the entire workflow. It enables the analysis of various fiber reconstruction algorithms, of differently parameterized fiber reconstruction algorithms and of individual steps in iterative fiber reconstruction algorithms. Insight into the performance of fiber reconstruction algorithms is obtained by a list‐based ranking interface. A 3D view offers interactive visualization techniques to gain deeper insight, e.g., into the aggregated quality of the examined fiber reconstruction algorithms and parameterizations. The tool was designed in close collaboration with researchers who work with fiber‐reinforced polymers on a daily basis and develop algorithms for tomographic reconstruction and characterization of such materials. We evaluate the tool using synthetic datasets as well as tomograms of real materials. Five case studies certify the usefulness of the tool, showing that it significantly accelerates the analysis and provides valuable insights that make it possible to improve the fiber reconstruction algorithms. The main contribution of the paper is the well‐considered combination of methods and their seamless integration into a visual tool that supports the entire workflow. Further findings result from the analysis of (dis‐)similarity measures for fibers as well as from the discussion of design decisions. It is also shown that the generality of the analytical methods allows a wider range of applications, such as the application in pore space analysis. Y1 - 2019 U6 - https://doi.org/10.1111/cgf.13688 VL - 38 IS - 3 SP - 273 EP - 283 ER - TY - JOUR A1 - Thiel, Denise A1 - Djurdjevac Conrad, Natasa A1 - Ntini, Evgenia A1 - Peschutter, Ria A1 - Siebert, Heike A1 - Marsico, Annalisa T1 - Identifying lncRNA-mediated regulatory modules via ChIA-PET network analysis JF - BMC Bioinformatics N2 - Background: Although several studies have provided insights into the role of long non-coding RNAs (lncRNAs), the majority of them have unknown function. Recent evidence has shown the importance of both lncRNAs and chromatin interactions in transcriptional regulation. Although network-based methods, mainly exploiting gene-lncRNA co-expression, have been applied to characterize lncRNA of unknown function by means of ’guilt-by-association’, no strategy exists so far which identifies mRNA-lncRNA functional modules based on the 3D chromatin interaction graph. Results: To better understand the function of chromatin interactions in the context of lncRNA-mediated gene regulation, we have developed a multi-step graph analysis approach to examine the RNA polymerase II ChIA-PET chromatin interaction network in the K562 human cell line. We have annotated the network with gene and lncRNA coordinates, and chromatin states from the ENCODE project. We used centrality measures, as well as an adaptation of our previously developed Markov State Models (MSM) clustering method, to gain a better understanding of lncRNAs in transcriptional regulation. The novelty of our approach resides in the detection of fuzzy regulatory modules based on network properties and their optimization based on co-expression analysis between genes and gene-lncRNA pairs. This results in our method returning more bona fide regulatory modules than other state-of-the art approaches for clustering on graphs. Conclusions: Interestingly, we find that lncRNA network hubs tend to be significantly enriched in evolutionary conserved lncRNAs and enhancer-like functions. We validated regulatory functions for well known lncRNAs, such as MALAT1 and the enhancer-like lncRNA FALEC. In addition, by investigating the modular structure of bigger components we mine putative regulatory functions for uncharacterized lncRNAs. Y1 - 2019 U6 - https://doi.org/10.1186/s12859-019-2900-8 VL - 20 IS - 1471-2105 ER -