Ulrich Bauer

ORCID: 0000-0002-9683-0724
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Topological and Geometric Data Analysis
  • Homotopy and Cohomology in Algebraic Topology
  • Advanced Neuroimaging Techniques and Applications
  • Advanced Combinatorial Mathematics
  • Cell Image Analysis Techniques
  • Digital Image Processing Techniques
  • Corporate Governance and Management
  • Medical Image Segmentation Techniques
  • 3D Shape Modeling and Analysis
  • Markov Chains and Monte Carlo Methods
  • Alzheimer's disease research and treatments
  • Commutative Algebra and Its Applications
  • Graph theory and applications
  • vaccines and immunoinformatics approaches
  • Image Retrieval and Classification Techniques
  • Immune responses and vaccinations
  • Digital Innovation in Industries
  • Computational Geometry and Mesh Generation
  • Electrocatalysts for Energy Conversion
  • Advanced Graph Neural Networks
  • Catalytic Alkyne Reactions
  • Plant Molecular Biology Research
  • Advanced Vision and Imaging
  • Computer Graphics and Visualization Techniques
  • Advanced Topology and Set Theory

Technical University of Munich
2013-2025

Friedrich-Alexander-Universität Erlangen-Nürnberg
1993-2020

Centre Jean Perrin
2019

Institute of Science and Technology Austria
2013-2015

University of Göttingen
2009-2011

Freie Universität Berlin
2007-2008

Berlin Mathematical School
2007

University of Oulu
1997

University of Rostock
1983-1994

Topological data analysis offers a rich source of valuable information to study vision problems. Yet, so far we lack theoretically sound connection popular kernel-based learning techniques, such as kernel SVMs or PCA. In this work, establish by designing multi-scale for persistence diagrams, stable summary representation topological features in data. We show that is positive definite and prove its stability with respect the 1-Wasserstein distance. Experiments on two benchmark datasets 3D...

10.1109/cvpr.2015.7299106 article EN 2015-06-01

Accurate segmentation of tubular, network-like structures, such as vessels, neurons, or roads, is relevant to many fields research. For the topology their most important characteristic; particularly preserving connectedness: in case vascular networks, missing a connected vessel entirely alters blood-flow dynamics. We introduce novel similarity measure termed centerlineDice (short clDice), which calculated on inter-section masks and (morphological) skeleta. theoretically prove that clDice...

10.1109/cvpr46437.2021.01629 preprint EN 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) 2021-06-01

We present an algorithm for the computation of Vietoris-Rips persistence barcodes and describe its implementation in software Ripser. The method relies on implicit representations coboundary operator filtration order simplices, avoiding explicit construction storage matrix. Moreover, it makes use apparent pairs, a simple but powerful constructing discrete gradient field from total simplices simplicial complex, which is also independent interest. Our shows substantial improvements over...

10.1007/s41468-021-00071-5 article EN cc-by Journal of Applied and Computational Topology 2021-06-17

10.1016/j.jsc.2016.03.008 article EN publisher-specific-oa Journal of Symbolic Computation 2016-03-30

We propose a metric for Reeb graphs, called the functional distortion distance. Under this distance, graph is stable against small changes of input functions. At same time, it remains discriminative at differentiating In particular, main result that distance between two graphs bounded from below by bottleneck both ordinary and extended persistence diagrams appropriate dimensions.

10.1145/2582112.2582169 preprint EN 2014-05-02

Abstract We establish tight bi-Lipschitz bounds certifying quasi-universality (universality up to a constant factor) for various distances between Reeb graphs: the interleaving distance, functional distortion and contortion distance. The definition of latter distance is novel contribution, special case contour trees we also prove strict universality this Furthermore, that merge coincides with yielding all four in case.

10.1007/s41468-025-00203-1 article EN cc-by Journal of Applied and Computational Topology 2025-02-12

We define a simple, explicit map sending morphism f: M → N of pointwise finite dimensional persistence modules to matching between the barcodes and N. Our main result is that, in precise sense, quality this tightly controlled by lengths longest intervals ker f coker f.

10.1145/2582112.2582168 article EN 2014-05-02

We solve the problem of minimizing number critical points among all functions on a surface within prescribed distance {\delta} from given input function. The result is achieved by establishing connection between discrete Morse theory and persistent homology. Our method completely removes homological noise with persistence less than 2{\delta}, constructively proving tightness lower bound stability theorem homology in dimension two for any also show that an optimal solution can be computed...

10.1007/s00454-011-9350-z article EN cc-by-nc Discrete & Computational Geometry 2011-04-26

For $X$ a finite category and $F$ field, we study the additive image of functor $\operatorname{H}_0(-,F) \colon \operatorname{rep}(X, \mathbf{Top}) \to \mathbf{Vect}_F)$, or equivalently, free $\operatorname{rep}(X, \mathbf{Set}) \mathbf{Vect}_F)$. We characterize all categories for which indecomposables in coincide with indecomposable indicator representations provide examples quivers wild representation type where contains only finitely many indecomposables. Motivated by questions...

10.48550/arxiv.2501.09132 preprint EN arXiv (Cornell University) 2025-01-15

Abstract Algebraic persistence studies modules (typically, linear representations of the poset $\textbf{R}^{n}$ with $n \geq 1$) and algebraic relationships between that are interleaved. The notion $\varepsilon $-interleaving is a generalization isomorphism (recovering when = 0$), which can be used to quantify how far any two from being isomorphic. An emblematic example this kind study stability theorem, strengthens Krull–Schmidt property one-parameter (representations $\textbf{R}$) by...

10.1093/imrn/rnaf034 article EN cc-by International Mathematics Research Notices 2025-02-26

Despite their favorable pharmacokinetic properties, single-chain Fv antibody fragments (scFvs) are not commonly used as therapeutics, mainly due to generally low stabilities and poor production yields. In this work, we describe the identification optimization of a human scFv scaffold, termed FW1.4, which is suitable for humanization stabilization broad variety rabbit variable domains. A motif consisting five structurally relevant framework residues that highly conserved in domains was...

10.1074/jbc.m109.072876 article EN cc-by Journal of Biological Chemistry 2010-01-08

We define a simple, explicit map sending morphism $f:M \rightarrow N$ of pointwise finite dimensional persistence modules to matching between the barcodes $M$ and $N$. Our main result is that, in precise sense, quality this tightly controlled by lengths longest intervals $\ker f$ $\mathop{\mathrm{coker}} f$. As an immediate corollary, we obtain new proof algebraic stability persistence, fundamental theory persistent homology. In contrast previous proofs, ours shows explicitly how...

10.48550/arxiv.1311.3681 preprint EN other-oa arXiv (Cornell University) 2013-01-01

Given a finite set of points in $\mathbb R^n$ and radius parameter, we study the \v{C}ech, Delaunay-\v{C}ech, Delaunay (or Alpha), Wrap complexes light generalized discrete Morse theory. Establishing \v{C}ech as sublevel sets functions, prove that four are simple-homotopy equivalent by sequence simplicial collapses, which explicitly described single gradient field.

10.1090/tran/6991 article EN publisher-specific-oa Transactions of the American Mathematical Society 2016-06-17

Abstract We consider the setting of Reeb graphs piecewise linear functions and study distances between them that are stable, meaning which similar in supremum norm ought to have graphs. define an edit distance for prove it is stable universal, provides upper bound any other distance. In contrast, via a specific construction, we show interleaving functional distortion on not universal.

10.1007/s10208-020-09488-3 article EN cc-by Foundations of Computational Mathematics 2020-12-29

We investigate the reactivity of hexagonal boron nitride (h-BN) on a Ni(1 1 1) single crystal towards atomic hydrogen over wide exposure range. Near edge x-ray absorption fine structure and photoelectron spectroscopy (XPS) show that for low exposures hydrogenation h-BN sheet is found. In contrast, intercalation between substrate occurs high exposures. For intermediate regimes, mixture observed. From temperature-programmed desorption XPS experiments, we conclude covalently bound to rather...

10.1088/2053-1583/aa7d6b article EN 2D Materials 2017-08-03

We have investigated the surface chemistry of molecular solar thermal energy storage system valence isomer pair norbornadiene (NBD)/quadricyclane (QC) on Ni(111). Our multimethod approach includes UV-photoelectron spectroscopy (UPS), high-resolution X-ray photoelectron (XPS), near edge absorption fine structure (NEXAFS), and density functional theory (DFT) calculations. The NBD/QC holds potential to be utilized in future technologies due its comparably high gravimetric density, release a...

10.1021/acs.jpcc.8b03746 article EN The Journal of Physical Chemistry C 2018-06-05

The Reeb graph is a construction that studies topological space through the lens of real valued function. It has widely been used in applications, however its use on data means it desirable and increasingly necessary to have methods for comparison graphs. Recently, several define metrics graphs presented. In this paper, we focus two: functional distortion distance interleaving distance. former based Gromov--Hausdorff distance, while latter utilizes equivalence between particular class...

10.48550/arxiv.1412.6646 preprint EN other-oa arXiv (Cornell University) 2014-01-01

Abstract The extended persistence diagram is an invariant of piecewise linear functions, which known to be stable under perturbations functions with respect the bottleneck distance as introduced by Cohen–Steiner, Edelsbrunner, and Harer. We address question universality, asks for largest possible on diagrams, showing that a more discriminative variant universal. Our result applies generally settings where diagrams are considered only up certain degree. achieve our results establishing...

10.1007/s41468-024-00184-7 article EN cc-by Journal of Applied and Computational Topology 2024-07-01
Coming Soon ...