@article{SipiranLazoLopezetal.2021, author = {Sipiran, Ivan and Lazo, Patrick and Lopez, Cristian and Bagewadi, Nihar and Bustos, Benjamin and Dao, Hieu and Gangisetty, Shankar and Hanik, Martin and Ho-Thi, Ngoc-Phuong and Holenderski, Mike and Jarnikov, Dmitri and Labrada, Arniel and Lengauer, Stefan and Licandro, Roxane and Nguyen, Dinh-Huan and Nguyen-Ho, Thang-Long and P{\´e}rez Rey, Luis A. and Pham, Bang-Dang and Pham, Minh-Khoi and Preiner, Reinhold and Schreck, Tobias and Trinh, Quoc-Huy and Tonnaer, Loek and von Tycowicz, Christoph and Vu-Le, The-Anh}, title = {SHREC 2021: Retrieval of Cultural Heritage Objects}, volume = {100}, journal = {Computers and Graphics}, doi = {10.1016/j.cag.2021.07.010}, pages = {1 -- 20}, year = {2021}, abstract = {This paper presents the methods and results of the SHREC'21 contest on a dataset of cultural heritage (CH) objects. We present a dataset of 938 scanned models that have varied geometry and artistic styles. For the competition, we propose two challenges: the retrieval-by-shape challenge and the retrieval-by-culture challenge. The former aims at evaluating the ability of retrieval methods to discriminate cultural heritage objects by overall shape. The latter focuses on assessing the effectiveness of retrieving objects from the same culture. Both challenges constitute a suitable scenario to evaluate modern shape retrieval methods in a CH domain. Ten groups participated in the contest: thirty runs were submitted for the retrieval-by-shape task, and twenty-six runs were submitted for the retrieval-by-culture challenge. The results show a predominance of learning methods on image-based multi-view representations to characterize 3D objects. Nevertheless, the problem presented in our challenges is far from being solved. We also identify the potential paths for further improvements and give insights into the future directions of research.}, language = {en} } @article{MoewisKaiserTrepczynskietal.2021, author = {Moewis, Philippe and Kaiser, Ren{\´e} and Trepczynski, Adam and von Tycowicz, Christoph and Krahl, Leonie and Ilg, Ansgar and Holz, Johannes and Duda, Georg}, title = {Patient specific resurfacing implant knee surgery in subjects with early osteoarthritis results in medial pivot and lateral femoral rollback during flexion: A retrospective pilot study}, journal = {Knee Surgery, Sports Traumatology, Arthroscopy}, doi = {10.1007/s00167-021-06749-8}, year = {2021}, abstract = {Purpose. Metallic resurfacing implants have been developed for the treatment of early, focal, small, condylar and trochlear osteoarthritis (OA) lesions. They represent an option for patients who are either too young to fulfill the criteria for total knee arthroplasty (TKA) or too old for biological treatment. Although relevant clinical evidence has been collected for different resurfacing types, the in vivo post-operative knee kinematics remains unknown. The present study aims to measure and analyse the knee joint kinematics in subjects with patient-specific Episealer implants Methods. Retrospective study design. Fluoroscopic analyses during high flexion activities (unloaded flexion-extension and loaded lunge) were conducted at >12 months post-surgery in ten Episealer knees. The post-operative knee joint kinematics was compared to equally assessed kinematic from ten healthy knees, twenty G-Curve TKA knees and 10 J-Curve knees. Pre- and postoperative clinical data of the Episealer knees were collected using a visual analog scale (VAS), the EQ 5d Health Questionnaire and the Knee Injury and Osteoarthritis Outcome Score (KOOS). Results. During unloaded flexion-extension and loaded lunge, the medial condyle in the Episealer knees remained relative stationary, indicating a medial pivot, while the lateral condyle translated consistently towards posterior. Similarly, reduced movement of the medial condyle and posterior translation of the lateral condyle was also observed in the healthy knees, although to a lesser extent. In contrast, the kinematics of both TKA cohorts during unloaded flexion-extension showed a tendency towards anterior displacement in the medial compartment, which led to significant differences in comparison with the Episealer knees. In the lateral compartment, a certain degree of femoral rollback was noted in the G-Curve TKA cohort. Improved scores were observed in the Episealer subjects between the preoperative and 1-year postoperative follow-up. Conclusion. At 12 months postsurgery, a physiological-like knee kinematics was observed in the group of patient-specific reconstructed chondral/osteochondral lesions by means of a resurfacing Episealer implant strategy. Considering that these patients are physically active and do not fulfill the criteria for TKA, the group is hard to be compared to TKA patients which usually are less active and more challenging. Nevertheless, the comparison to either healthy knee kinematics as well as to TKA reconstructed knees with different implant designs showed a more physiological-like kinematics in the resurfacing implants that seems more appropriate for such a patient group. Despite positive results, careful clinical follow-up of treated patients is recommended for the long-term OA progression. Further investigations need to be encouraged not only in larger patient groups but also in a prospective manner to assess the pre- to postoperative kinematic changes.}, language = {en} } @misc{Punjabi2021, type = {Master Thesis}, author = {Punjabi, Dev}, title = {Orientation-invariant Dense Correspondence using Graph Convolutional Neural Networks}, pages = {41}, year = {2021}, language = {en} } @misc{AmbellanZachowvonTycowicz2021, author = {Ambellan, Felix and Zachow, Stefan and von Tycowicz, Christoph}, title = {Geodesic B-Score for Improved Assessment of Knee Osteoarthritis}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-81930}, year = {2021}, abstract = {Three-dimensional medical imaging enables detailed understanding of osteoarthritis structural status. However, there remains a vast need for automatic, thus, reader-independent measures that provide reliable assessment of subject-specific clinical outcomes. To this end, we derive a consistent generalization of the recently proposed B-score to Riemannian shape spaces. We further present an algorithmic treatment yielding simple, yet efficient computations allowing for analysis of large shape populations with several thousand samples. Our intrinsic formulation exhibits improved discrimination ability over its Euclidean counterpart, which we demonstrate for predictive validity on assessing risks of total knee replacement. This result highlights the potential of the geodesic B-score to enable improved personalized assessment and stratification for interventions.}, language = {en} } @article{MelnykMontavonKlusetal.2020, author = {Melnyk, Kateryna and Montavon, Gr{\`e}goire and Klus, Stefan and Conrad, Tim}, title = {Graph Kernel Koopman Embedding for Human Microbiome Analysis}, volume = {5}, journal = {Applied Network Science}, number = {96}, doi = {10.1007/s41109-020-00339-2}, year = {2020}, abstract = {More and more diseases have been found to be strongly correlated with disturbances in the microbiome constitution, e.g., obesity, diabetes, or some cancer types. Thanks to modern high-throughput omics technologies, it becomes possible to directly analyze human microbiome and its influence on the health status. Microbial communities are monitored over long periods of time and the associations between their members are explored. These relationships can be described by a time-evolving graph. In order to understand responses of the microbial community members to a distinct range of perturbations such as antibiotics exposure or diseases and general dynamical properties, the time-evolving graph of the human microbial communities has to be analyzed. This becomes especially challenging due to dozens of complex interactions among microbes and metastable dynamics. The key to solving this problem is the representation of the time-evolving graphs as fixed-length feature vectors preserving the original dynamics. We propose a method for learning the embedding of the time-evolving graph that is based on the spectral analysis of transfer operators and graph kernels. We demonstrate that our method can capture temporary changes in the time-evolving graph on both synthetic data and real-world data. Our experiments demonstrate the efficacy of the method. Furthermore, we show that our method can be applied to human microbiome data to study dynamic processes.}, language = {en} } @article{IravaniConrad2023, author = {Iravani, Sahar and Conrad, Tim}, title = {An Interpretable Deep Learning Approach for Biomarker Detection in LC-MS Proteomics Data}, volume = {20}, journal = {IEEE/ACM Transactions on Computational Biology and Bioinformatics}, number = {1}, doi = {10.1109/tcbb.2022.3141656}, pages = {151 -- 161}, year = {2023}, abstract = {Analyzing mass spectrometry-based proteomics data with deep learning (DL) approaches poses several challenges due to the high dimensionality, low sample size, and high level of noise. Additionally, DL-based workflows are often hindered to be integrated into medical settings due to the lack of interpretable explanation. We present DLearnMS, a DL biomarker detection framework, to address these challenges on proteomics instances of liquid chromatography-mass spectrometry (LC-MS) - a well-established tool for quantifying complex protein mixtures. Our DLearnMS framework learns the clinical state of LC-MS data instances using convolutional neural networks. Based on the trained neural networks, we show how biomarkers can be identified using layer-wise relevance propagation. This enables detecting discriminating regions of the data and the design of more robust networks. One of the main advantages over other established methods is that no explicit preprocessing step is needed in our DLearnMS framework. Our evaluation shows that DLearnMS outperforms conventional LC-MS biomarker detection approaches in identifying fewer false positive peaks while maintaining a comparable amount of true positives peaks.}, language = {en} } @article{RamsConrad2022, author = {Rams, Mona and Conrad, Tim}, title = {Dictionary learning allows model-free pseudotime estimation of transcriptomics data}, volume = {23}, journal = {BMC Genomics}, publisher = {BioMed Central}, doi = {10.1186/s12864-021-08276-9}, year = {2022}, language = {en} } @article{FroehlerElberfeldMoelleretal.2020, author = {Fr{\"o}hler, Bernhard and Elberfeld, Tim and M{\"o}ller, Torsten and Hege, Hans-Christian and De Beenhouwer, Jan and Sijbers, Jan and Kastner, Johann and Heinzl, Christoph}, title = {Analysis and comparison of algorithms for the tomographic reconstruction of curved fibres}, volume = {35}, journal = {Nondestructive Testing and Evaluation}, number = {3}, doi = {10.1080/10589759.2020.1774583}, pages = {328 -- 341}, year = {2020}, abstract = {We present visual methods for the analysis and comparison of the results of curved fibre reconstruction algorithms, i.e., of algorithms extracting characteristics of curved fibres from X-ray computed tomography scans. In this work, we extend previous methods for the analysis and comparison of results of different fibre reconstruction algorithms or parametrisations to the analysis of curved fibres. We propose fibre dissimilarity measures for such curved fibres and apply these to compare multiple results to a specified reference. We further propose visualisation methods to analyse differences between multiple results quantitatively and qualitatively. In two case studies, we show that the presented methods provide valuable insights for advancing and parametrising fibre reconstruction algorithms, and support in improving their results in characterising curved fibres.}, language = {en} } @misc{Dill2018, type = {Master Thesis}, author = {Dill, Sabrina}, title = {Joint Feature Learning and Classification - Deep Learning for Surgical Phase Detection}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-81745}, year = {2018}, abstract = {In this thesis we investigate the task of automatically detecting phases in surgical workflow in endoscopic video data. For this, we employ deep learning approaches that solely rely on frame-wise visual information, instead of using additional signals or handcrafted features. While previous work has mainly focused on tool presence and temporal information for this task, we reason that additional global information about the context of a frame might benefit the phase detection task. We propose novel deep learning architectures: a convolutional neural network (CNN) based model for the tool detection task only, called Clf-Net, as well as a model which performs joint (context) feature learning and tool classification to incorporate information about the context, which we name Context-Clf-Net. For the phase detection task lower-dimensional feature vectors are extracted, which are used as input to recurrent neural networks in order to enforce temporal constraints. We compare the performance of an online model, which only considers previous frames up to the current time step, to that of an offline model that has access to past and future information. Experimental results indicate that the tool detection task benefits strongly from the introduction of context information, as we outperform both Clf-Net results and stateof-the-art methods. Regarding the phase detection task our results do not surpass state-of-the-art methods. Furthermore, no improvement of using features learned by the Context-Clf-Net is observed in the phase detection task for both online and offline versions}, language = {en} } @article{WeimannConrad2021, author = {Weimann, K. and Conrad, Tim}, title = {Transfer Learning for ECG Classification}, volume = {11}, journal = {Scientific Reports}, doi = {10.1038/s41598-021-84374-8}, year = {2021}, abstract = {Remote monitoring devices, which can be worn or implanted, have enabled a more effective healthcare for patients with periodic heart arrhythmia due to their ability to constantly monitor heart activity. However, these devices record considerable amounts of electrocardiogram (ECG) data that needs to be interpreted by physicians. Therefore, there is a growing need to develop reliable methods for automatic ECG interpretation to assist the physicians. Here, we use deep convolutional neural networks (CNN) to classify raw ECG recordings. However, training CNNs for ECG classification often requires a large number of annotated samples, which are expensive to acquire. In this work, we tackle this problem by using transfer learning. First, we pretrain CNNs on the largest public data set of continuous raw ECG signals. Next, we finetune the networks on a small data set for classification of Atrial Fibrillation, which is the most common heart arrhythmia. We show that pretraining improves the performance of CNNs on the target task by up to 6.57\%, effectively reducing the number of annotations required to achieve the same performance as CNNs that are not pretrained. We investigate both supervised as well as unsupervised pretraining approaches, which we believe will increase in relevance, since they do not rely on the expensive ECG annotations. The code is available on GitHub at https://github.com/kweimann/ecg-transfer-learning.}, language = {en} } @article{LeDucConrad2020, author = {Le Duc, Huy and Conrad, Tim}, title = {A light-weight and highly flexible software system for analyzing large bio-medical datasets}, journal = {Future Generation Computer Systems}, year = {2020}, language = {en} } @article{JudsSchmidtWelleretal.2020, author = {Juds, Carmen and Schmidt, Johannes and Weller, Michael and Lange, Thorid and Conrad, Tim and Boerner, Hans}, title = {Combining Phage Display and Next-generation Sequencing for Materials Sciences: A Case Study on Probing Polypropylene Surfaces}, volume = {142}, journal = {Journal of the American Chemical Society}, number = {24}, doi = {10.1021/jacs.0c03482}, pages = {10624 -- 10628}, year = {2020}, abstract = {Phage display biopanning with Illumina next-generation sequencing (NGS) is applied to reveal insights into peptide-based adhesion domains for polypropylene (PP). One biopanning round followed by NGS selects robust PP-binding peptides that are not evident by Sanger sequencing. NGS provides a significant statistical base that enables motif analysis, statistics on positional residue depletion/enrichment, and data analysis to suppress false-positive sequences from amplification bias. The selected sequences are employed as water-based primers for PP?metal adhesion to condition PP surfaces and increase adhesive strength by 100\\% relative to nonprimed PP.}, language = {en} } @article{CvetkovicConradLie2021, author = {Cvetkovic, Nada and Conrad, Tim and Lie, Han Cheng}, title = {A Convergent Discretisation Method for Transition Path Theory for Diffusion Processes}, volume = {19}, journal = {Multiscale Modeling \& Simulation}, number = {1}, publisher = {Society for Industrial and Applied Mathematics}, doi = {10.1137/20M1329354}, pages = {242 -- 266}, year = {2021}, language = {en} } @article{GreweLiuKahletal.2021, author = {Grewe, Carl Martin and Liu, Tuo and Kahl, Christoph and Andrea, Hildebrandt and Zachow, Stefan}, title = {Statistical Learning of Facial Expressions Improves Realism of Animated Avatar Faces}, volume = {2}, journal = {Frontiers in Virtual Reality}, publisher = {Frontiers}, doi = {10.3389/frvir.2021.619811}, pages = {1 -- 13}, year = {2021}, language = {en} } @phdthesis{Ambellan2022, author = {Ambellan, Felix}, title = {Efficient Riemannian Statistical Shape Analysis with Applications in Disease Assessment}, doi = {10.17169/refubium-36729}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:188-refubium-37016-3}, year = {2022}, abstract = {In this work, we address the challenge of developing statistical shape models that account for the non-Euclidean nature inherent to (anatomical) shape variation and at the same time offer fast, numerically robust processing and as much invariance as possible regarding translation and rotation, i.e. Euclidean motion. With the aim of doing that we formulate a continuous and physically motivated notion of shape space based on deformation gradients. We follow two different tracks endowing this differential representation with a Riemannian structure to establish a statistical shape model. (1) We derive a model based on differential coordinates as elements in GL(3)+. To this end, we adapt the notion of bi-invariant means employing an affine connection structure on GL(3)+. Furthermore, we perform second-order statistics based on a family of Riemannian metrics providing the most possible invariance, viz. GL(3)+-left-invariance and O(3)-right-invariance. (2) We endow the differential coordinates with a non-Euclidean structure, that stems from a product Lie group of stretches and rotations. This structure admits a bi-invariant metric and thus allows for a consistent analysis via manifold-valued Riemannian statistics. This work further presents a novel shape representation based on discrete fundamental forms that is naturally invariant under Euclidean motion, namely the fundamental coordinates. We endow this representation with a Lie group structure that admits bi-invariant metrics and therefore allows for consistent analysis using manifold-valued statistics based on the Riemannian framework. Furthermore, we derive a simple, efficient, robust, yet accurate (i.e. without resorting to model approximations) solver for the inverse problem that allows for interactive applications. Beyond statistical shape modeling the proposed framework is amenable for surface processing such as quasi-isometric flattening. Additionally, the last part of the thesis aims on shape-based, continuous disease stratification to provide means that objectify disease assessment over the current clinical practice of ordinal grading systems. Therefore, we derive the geodesic B-score, a generalization of the of the Euclidean B-score, in order to assess knee osteoarthritis. In this context we present a Newton-type fixed point iteration for projection onto geodesics in shape space. On the application side, we show that the derived geodesic B-score features, in comparison to its Euclidean counterpart, an improved predictive performance on assessing the risk of total knee replacement surgery.}, language = {en} } @article{NavaYazdaniHegevonTycowicz2022, author = {Nava-Yazdani, Esfandiar and Hege, Hans-Christian and von Tycowicz, Christoph}, title = {A Hierarchical Geodesic Model for Longitudinal Analysis on Manifolds}, volume = {64}, journal = {Journal of Mathematical Imaging and Vision}, number = {4}, doi = {10.1007/s10851-022-01079-x}, pages = {395 -- 407}, year = {2022}, abstract = {In many applications, geodesic hierarchical models are adequate for the study of temporal observations. We employ such a model derived for manifold-valued data to Kendall's shape space. In particular, instead of the Sasaki metric, we adapt a functional-based metric, which increases the computational efficiency and does not require the implementation of the curvature tensor. We propose the corresponding variational time discretization of geodesics and employ the approach for longitudinal analysis of 2D rat skulls shapes as well as 3D shapes derived from an imaging study on osteoarthritis. Particularly, we perform hypothesis test and estimate the mean trends.}, language = {en} } @inproceedings{AmiranashviliLuedkeLietal.2022, author = {Amiranashvili, Tamaz and L{\"u}dke, David and Li, Hongwei and Menze, Bjoern and Zachow, Stefan}, title = {Learning Shape Reconstruction from Sparse Measurements with Neural Implicit Functions}, booktitle = {Medical Imaging with Deep Learning}, year = {2022}, abstract = {Reconstructing anatomical shapes from sparse or partial measurements relies on prior knowledge of shape variations that occur within a given population. Such shape priors are learned from example shapes, obtained by segmenting volumetric medical images. For existing models, the resolution of a learned shape prior is limited to the resolution of the training data. However, in clinical practice, volumetric images are often acquired with highly anisotropic voxel sizes, e.g. to reduce image acquisition time in MRI or radiation exposure in CT imaging. The missing shape information between the slices prohibits existing methods to learn a high-resolution shape prior. We introduce a method for high-resolution shape reconstruction from sparse measurements without relying on high-resolution ground truth for training. Our method is based on neural implicit shape representations and learns a continuous shape prior only from highly anisotropic segmentations. Furthermore, it is able to learn from shapes with a varying field of view and can reconstruct from various sparse input configurations. We demonstrate its effectiveness on two anatomical structures: vertebra and femur, and successfully reconstruct high-resolution shapes from sparse segmentations, using as few as three orthogonal slices.}, language = {en} } @inproceedings{PaskinDeanBaumetal.2022, author = {Paskin, Martha and Dean, Mason and Baum, Daniel and von Tycowicz, Christoph}, title = {A Kendall Shape Space Approach to 3D Shape Estimation from 2D Landmarks}, booktitle = {Computer Vision -- ECCV 2022}, publisher = {Springer Nature Switzerland}, arxiv = {http://arxiv.org/abs/2207.12687}, doi = {10.1007/978-3-031-20086-1_21}, pages = {363 -- 379}, year = {2022}, abstract = {3D shapes provide substantially more information than 2D images. However, the acquisition of 3D shapes is sometimes very difficult or even impossible in comparison with acquiring 2D images, making it necessary to derive the 3D shape from 2D images. Although this is, in general, a mathematically ill-posed problem, it might be solved by constraining the problem formulation using prior information. Here, we present a new approach based on Kendall's shape space to reconstruct 3D shapes from single monocular 2D images. The work is motivated by an application to study the feeding behavior of the basking shark, an endangered species whose massive size and mobility render 3D shape data nearly impossible to obtain, hampering understanding of their feeding behaviors and ecology. 2D images of these animals in feeding position, however, are readily available. We compare our approach with state-of-the-art shape-based approaches both on human stick models and on shark head skeletons. Using a small set of training shapes, we show that the Kendall shape space approach is substantially more robust than previous methods and always results in plausible shapes. This is essential for the motivating application in which specimens are rare and therefore only few training shapes are available.}, language = {en} } @misc{PaskinBaumDeanetal.2022, author = {Paskin, Martha and Baum, Daniel and Dean, Mason N. and von Tycowicz, Christoph}, title = {A Kendall Shape Space Approach to 3D Shape Estimation from 2D Landmarks -- Source Code and Data}, doi = {10.12752/8730}, year = {2022}, abstract = {Source code and novel dataset of basking shark head skeletons facilitating the reproduction of the results presented in 'A Kendall Shape Space Approach to 3D Shape Estimation from 2D Landmarks' - ECCV 2022.}, language = {en} } @inproceedings{HarthVohraUdvaryetal.2022, author = {Harth, Philipp and Vohra, Sumit and Udvary, Daniel and Oberlaender, Marcel and Hege, Hans-Christian and Baum, Daniel}, title = {A Stratification Matrix Viewer for Analysis of Neural Network Data}, booktitle = {Eurographics Workshop on Visual Computing for Biology and Medicine (VCBM)}, address = {Vienna, Austria}, doi = {10.2312/vcbm.20221194}, year = {2022}, abstract = {The analysis of brain networks is central to neurobiological research. In this context the following tasks often arise: (1) understand the cellular composition of a reconstructed neural tissue volume to determine the nodes of the brain network; (2) quantify connectivity features statistically; and (3) compare these to predictions of mathematical models. We present a framework for interactive, visually supported accomplishment of these tasks. Its central component, the stratification matrix viewer, allows users to visualize the distribution of cellular and/or connectional properties of neurons at different levels of aggregation. We demonstrate its use in four case studies analyzing neural network data from the rat barrel cortex and human temporal cortex.}, language = {en} } @article{UdvaryHarthMackeetal.2022, author = {Udvary, Daniel and Harth, Philipp and Macke, Jakob H. and Hege, Hans-Christian and de Kock, Christiaan P. J. and Sakmann, Bert and Oberlaender, Marcel}, title = {The Impact of Neuron Morphology on Cortical Network Architecture}, volume = {39}, journal = {Cell Reports}, number = {2}, doi = {10.1016/j.celrep.2022.110677}, year = {2022}, abstract = {The neurons in the cerebral cortex are not randomly interconnected. This specificity in wiring can result from synapse formation mechanisms that connect neurons depending on their electrical activity and genetically defined identity. Here, we report that the morphological properties of the neurons provide an additional prominent source by which wiring specificity emerges in cortical networks. This morphologically determined wiring specificity reflects similarities between the neurons' axo-dendritic projections patterns, the packing density and cellular diversity of the neuropil. The higher these three factors are the more recurrent is the topology of the network. Conversely, the lower these factors are the more feedforward is the network's topology. These principles predict the empirically observed occurrences of clusters of synapses, cell type-specific connectivity patterns, and nonrandom network motifs. Thus, we demonstrate that wiring specificity emerges in the cerebral cortex at subcellular, cellular and network scales from the specific morphological properties of its neuronal constituents.}, language = {en} } @inproceedings{LuedkeAmiranashviliAmbellanetal.2022, author = {L{\"u}dke, David and Amiranashvili, Tamaz and Ambellan, Felix and Ezhov, Ivan and Menze, Bjoern and Zachow, Stefan}, title = {Landmark-free Statistical Shape Modeling via Neural Flow Deformations}, volume = {13432}, booktitle = {Medical Image Computing and Computer Assisted Intervention - MICCAI 2022}, publisher = {Springer, Cham}, arxiv = {http://arxiv.org/abs/2209.06861}, doi = {10.1007/978-3-031-16434-7_44}, year = {2022}, abstract = {Statistical shape modeling aims at capturing shape variations of an anatomical structure that occur within a given population. Shape models are employed in many tasks, such as shape reconstruction and image segmentation, but also shape generation and classification. Existing shape priors either require dense correspondence between training examples or lack robustness and topological guarantees. We present FlowSSM, a novel shape modeling approach that learns shape variability without requiring dense correspondence between training instances. It relies on a hierarchy of continuous deformation flows, which are parametrized by a neural network. Our model outperforms state-of-the-art methods in providing an expressive and robust shape prior for distal femur and liver. We show that the emerging latent representation is discriminative by separating healthy from pathological shapes. Ultimately, we demonstrate its effectiveness on two shape reconstruction tasks from partial data. Our source code is publicly available (https://github.com/davecasp/flowssm).}, language = {en} } @misc{SagnolHegeWeiser2016, author = {Sagnol, Guillaume and Hege, Hans-Christian and Weiser, Martin}, title = {Using sparse kernels to design computer experiments with tunable precision}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-59605}, year = {2016}, abstract = {Statistical methods to design computer experiments usually rely on a Gaussian process (GP) surrogate model, and typically aim at selecting design points (combinations of algorithmic and model parameters) that minimize the average prediction variance, or maximize the prediction accuracy for the hyperparameters of the GP surrogate. In many applications, experiments have a tunable precision, in the sense that one software parameter controls the tradeoff between accuracy and computing time (e.g., mesh size in FEM simulations or number of Monte-Carlo samples). We formulate the problem of allocating a budget of computing time over a finite set of candidate points for the goals mentioned above. This is a continuous optimization problem, which is moreover convex whenever the tradeoff function accuracy vs. computing time is concave. On the other hand, using non-concave weight functions can help to identify sparse designs. In addition, using sparse kernel approximations drastically reduce the cost per iteration of the multiplicative weights updates that can be used to solve this problem.}, language = {en} } @article{LelievreZhang2019, author = {Leli{\`e}vre, Tony and Zhang, Wei}, title = {Pathwise estimates for effective dynamics: the case of nonlinear vectorial reaction coordinates}, journal = {Multiscale Modeling and Simulation}, number = {17}, arxiv = {http://arxiv.org/abs/1805.01928}, doi = {10.1137/18M1186034}, pages = {1019 -- 1051}, year = {2019}, abstract = {Effective dynamics using conditional expectation was proposed in [F. Legoll and T. Leli{\`e}vre, Nonlinearity, 2010] to approximate the essential dynamics of high-dimensional diffusion processes along a given reaction coordinate. The approximation error of the effective dynamics when it is used to approximate the behavior of the original dynamics has been considered in recent years. As a continuation of the previous work [F. Legoll, T. Leli{\`e}vre, and S. Olla, Stoch. Process. Appl, 2017], in this paper we obtain pathwise estimates for effective dynamics when the reaction coordinate function is either nonlinear or vector-valued.}, language = {en} } @article{Zhang2021, author = {Zhang, Wei}, title = {Some new results on relative entropy production, time reversal, and optimal control of time-inhomogeneous diffusion processes}, volume = {62}, journal = {Journal of Mathematical Physics}, number = {4}, arxiv = {http://arxiv.org/abs/2006.11212}, doi = {10.1063/5.0038740}, pages = {26}, year = {2021}, abstract = {This paper studies time-inhomogeneous nonequilibrium diffusion processes, including both Brownian dynamics and Langevin dynamics. We derive upper bounds of the relative entropy production of the time-inhomogeneous process with respect to the transient invariant probability measures. We also study the time reversal of the reverse process in Crooks' fluctuation theorem. We show that the time reversal of the reverse process coincides with the optimally controlled forward process that leads to zero variance importance sampling estimator based on Jarzynski's equality.}, language = {en} } @article{ZhangKlusConradetal.2019, author = {Zhang, Wei and Klus, Stefan and Conrad, Tim and Sch{\"u}tte, Christof}, title = {Learning chemical reaction networks from trajectory data}, volume = {18}, journal = {SIAM Journal on Applied Dynamical Systems (SIADS)}, number = {4}, arxiv = {http://arxiv.org/abs/1902.04920}, doi = {10.1137/19M1265880}, pages = {2000 -- 2046}, year = {2019}, abstract = {We develop a data-driven method to learn chemical reaction networks from trajectory data. Modeling the reaction system as a continuous-time Markov chain and assuming the system is fully observed,our method learns the propensity functions of the system with predetermined basis functions by maximizing the likelihood function of the trajectory data under l^1 sparse regularization. We demonstrate our method with numerical examples using synthetic data and carry out an asymptotic analysis of the proposed learning procedure in the infinite-data limit.}, language = {en} } @inproceedings{IravaniConrad2019, author = {Iravani, Sahar and Conrad, Tim}, title = {Deep Learning for Proteomics Data for Feature Selection and Classification}, volume = {11713}, booktitle = {Machine Learning and Knowledge Extraction. CD-MAKE 2019}, editor = {Holzinger, A. and Kieseberg, P. and Tjoa, A. and Weippl, E.}, publisher = {Springer, Cham}, doi = {10.1007/978-3-030-29726-8_19}, year = {2019}, language = {en} } @article{ZhangHartmannvonKleist2018, author = {Zhang, Wei and Hartmann, Carsten and von Kleist, Max}, title = {Optimal control of Markov jump processes: Asymptotic analysis, algorithms and applications to the modeling of chemical reaction systems}, journal = {Communications in Mathematical Sciences}, doi = {10.4310/CMS.2018.v16.n2.a1}, pages = {293 -- 331}, year = {2018}, abstract = {Markov jump processes are widely used to model natural and engineered processes. In the context of biological or chemical applications one typically refers to the chemical master equation (CME), which models the evolution of the probability mass of any copy-number combination of the interacting particles. When many interacting particles ("species") are considered, the complexity of the CME quickly increases, making direct numerical simulations impossible. This is even more problematic when one aims at controlling the Markov jump processes defined by the CME. In this work, we study both open loop and feedback optimal control problems of the Markov jump processes in the case that the controls can only be switched at fixed control stages. Based on Kurtz's limit theorems, we prove the convergence of the respective control value functions of the underlying Markov decision problem as the copy numbers of the species go to infinity. In the case of the optimal control problem on a finite time-horizon, we propose a hybrid control policy algorithm to overcome the difficulties due to the curse of dimensionality when the copy number of the involved species is large. Two numerical examples demonstrate the suitability of both the analysis and the proposed algorithms.}, language = {en} } @article{SharmaZhang2021, author = {Sharma, Upanshu and Zhang, Wei}, title = {Non-reversible sampling schemes on submanifolds}, volume = {59}, journal = {SIAM Journal on Numerical Analysis}, number = {6}, arxiv = {http://arxiv.org/abs/2011.02835}, doi = {10.1137/20M1378752}, pages = {2989 -- 3031}, year = {2021}, abstract = {Calculating averages with respect to probability measures on submanifolds is often necessary in various application areas such as molecular dynamics, computational statistical mechanics and Bayesian statistics. In recent years, various numerical schemes have been proposed in the literature to study this problem based on appropriate reversible constrained stochastic dynamics. In this paper we present and analyse a non-reversible generalisation of the projection-based scheme developed by one of the authors [ESAIM: M2AN, 54 (2020), pp. 391-430]. This scheme consists of two steps - starting from a state on the submanifold, we first update the state using a non-reversible stochastic differential equation which takes the state away from the submanifold, and in the second step we project the state back onto the manifold using the long-time limit of a ordinary differential equation. We prove the consistency of this numerical scheme and provide quantitative error estimates for estimators based on finite-time running averages. Furthermore, we present theoretical analysis which shows that this scheme outperforms its reversible counterpart in terms of asymptotic variance. We demonstrate our findings on an illustrative test example.}, language = {en} } @article{Zhang2019, author = {Zhang, Wei}, title = {Ergodic SDEs on submanifolds and related numerical sampling schemes}, journal = {ESAIM: Mathematical Modelling and Numerical Analysis}, arxiv = {http://arxiv.org/abs/1702.08064}, year = {2019}, abstract = {In many applications, it is often necessary to sample the mean value of certain quantity with respect to a probability measure \$\mu\$ on the level set of a smooth function ξ:R^d→R^k, 1≤k