TY - CHAP A1 - Kälberer, Felix A1 - Tycowicz, Christoph von A1 - Polthier, Konrad T1 - Lossless Compression of Adaptive Multiresolution Meshes T2 - XXII Brazilian Symposium on Computer Graphics and Image Processing N2 - We present a novel coder for lossless compression of adaptive multiresolution meshes that exploits their special hierarchical structure. The heart of our method is a new progressive connectivity coder that can be combined with leading geometry encoding techniques. The compressor uses the parent/child relationships inherent to the hierarchical mesh. We use the rules that accord to the refinement scheme and store bits only where it leaves freedom of choice, leading to compact codes that are free of redundancy. To illustrate our scheme we chose the widespread red-green refinement, but the underlying concepts can be directly transferred to other adaptive refinement schemes as well. The compression ratio of our method exceeds that of state-of-the-art coders by a factor of 2 to 3 on most of our benchmark models. Y1 - 2009 U6 - https://doi.org/10.1109/SIBGRAPI.2009.53 SP - 80 EP - 87 ER - TY - CHAP A1 - Tycowicz, Christoph von A1 - Loviscach, Jörn T1 - Measuring and Enhancing the Legibility of GPU-rendered Text T2 - Eurographics 2008 Short Papers N2 - The limited spatial resolution of standard computer displays impedes the legibility of text. To improve the rendering, we have developed a number of strategies that employ GPU-based shader programs and appropriate preprocessing steps. We devised and implemented a set of methods that may be used alone or in combination ranging from simple measures such as gamma-correct MIPmapping to complex ones such as RGB subpixel rendering combined with supersampling. We have researched into their performance in terms of both legibility and speed. We difinded a psychovisual test that quantifies legibility quickly enough to compare a selection of promising techniques. The results allow to choose the optimum blend of rendering methods for a given set of requirements. Y1 - 2008 SP - 45 EP - 48 ER - TY - CHAP A1 - Greenhalgh, Chris A1 - Benford, Steve A1 - Drozd, Adam A1 - Flintham, Martin A1 - Hampshire, Alastair A1 - Oppermann, Leif A1 - Smith, Keir A1 - Tycowicz, Christoph von T1 - Addressing Mobile Phone Diversity in Ubicomp Experience Development T2 - UbiComp 2007: Ubiquitous Computing, 9th International Conference N2 - Mobile phones are a widely-available class of device with supporting communications infrastructure which can be appropriated and exploited to support ubicomp experiences. However mobile phones vary hugely in their capabilities. We explore how a single dimension of phone application type embodies the critical trade-off between capability and availability, i.e. between what can be done and the fraction of potential participants’ phones that can do this. We describe four different mobile phone ubicomp experiences that illustrate different points along this continuum (SMS, WAP/Web, and J2ME, Python and native applications) and the common software platform/toolkit, EQUIP2, that has been co-developed to support them. From this we propose four development strategies for addressing mobile phone diversity: prioritise support for server development (including web integration), migrate functionality between server(s) and handset(s), support flexible communication options, and use a loosely coupled (data-driven and component-based) software approach. Y1 - 2007 U6 - https://doi.org/10.1007/978-3-540-74853-3_26 VL - 4717 SP - 447 EP - 464 ER - TY - THES A1 - Tycowicz, Christoph von T1 - Concepts and Algorithms for the Deformation, Analysis, and Compression of Digital Shapes N2 - This thesis concerns model reduction techniques for the efficient numerical treatment of physical systems governing the deformation behavior of geometrically complex shapes. We present new strategies for the construction of simplified, low-dimensional models that capture the main features of the original complex system and are suitable for use in interactive computer graphics applications. To demonstrate the effectiveness of the new techniques we propose frameworks for real-time simulation and interactive deformation-based modeling of elastic solids and shells and compare them to alternative approaches. In addition, we investigate differential operators that are derived from the physical models and hence can serve as alternatives to the Laplace-Beltrami operator for applications in modal shape analysis. Furthermore, this thesis addresses the compression of digital shapes. In particular, we present a lossless compression scheme that is adapted to the special characteristics of adaptively refined, hierarchical meshes. Y1 - 2014 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:188-fudissthesis000000096721-7 UR - http://www.diss.fu-berlin.de/diss/receive/FUDISS_thesis_000000096721 ER - TY - CHAP A1 - Polthier, Konrad A1 - Bobenko, Alexander A1 - Hildebrandt, Klaus A1 - Kornhuber, Ralf A1 - Tycowicz, Christoph von A1 - Yserentant, Harry A1 - Ziegler, Günter M. T1 - Geometry processing T2 - MATHEON - Mathematics for Key Technologies Y1 - 2014 SN - 978-3-03719-137-8 U6 - https://doi.org/10.4171/137 VL - 1 SP - 341 EP - 355 PB - EMS Publishing House ER - TY - CHAP A1 - Oppermann, Leif A1 - Jacobs, R. A1 - Watkins, M. A1 - Shackford, R. A1 - Tycowicz, Christoph von A1 - Wright, M. A1 - Capra, M. A1 - Greenhalgh, Chris A1 - Benford, Steve T1 - Love City: A Text-Driven, Location-Based Mobile Phone Game Played Between 3 Cities T2 - Pervasive Gaming Applications - A Reader for Pervasive Gaming Research Y1 - 2007 SN - 978-3-8322-6224-2 VL - 2 SP - 285 EP - 312 PB - Shaker Verlag ER - TY - CHAP A1 - Greenhalgh, Chris A1 - Benford, Steve A1 - Drozd, Adam A1 - Flintham, Martin A1 - Hampshire, Alastair A1 - Oppermann, Leif A1 - Smith, Keir A1 - Tycowicz, Christoph von T1 - EQUIP2: A Platform for Mobile Phone-based Game Development T2 - Concepts and Technologies for Pervasive Games - A Reader for Pervasive Gaming Research Y1 - 2007 SN - 978-3-8322-6223-5 VL - 1 SP - 153 EP - 178 PB - Shaker Verlag ER - TY - JOUR A1 - von Tycowicz, Christoph A1 - Ambellan, Felix A1 - Mukhopadhyay, Anirban A1 - Zachow, Stefan T1 - An Efficient Riemannian Statistical Shape Model using Differential Coordinates JF - Medical Image Analysis N2 - We propose a novel Riemannian framework for statistical analysis of shapes that is able to account for the nonlinearity in shape variation. By adopting a physical perspective, we introduce a differential representation that puts the local geometric variability into focus. We model these differential coordinates as elements of a Lie group thereby endowing our shape space with a non-Euclidean structure. A key advantage of our framework is that statistics in a manifold shape space becomes numerically tractable improving performance by several orders of magnitude over state-of-the-art. We show that our Riemannian model is well suited for the identification of intra-population variability as well as inter-population differences. In particular, we demonstrate the superiority of the proposed model in experiments on specificity and generalization ability. We further derive a statistical shape descriptor that outperforms the standard Euclidean approach in terms of shape-based classification of morphological disorders. Y1 - 2018 U6 - https://doi.org/10.1016/j.media.2017.09.004 VL - 43 IS - 1 SP - 1 EP - 9 ER - TY - JOUR A1 - Brandt, Christopher A1 - Tycowicz, Christoph von A1 - Hildebrandt, Klaus T1 - Geometric Flows of Curves in Shape Space for Processing Motion of Deformable Objects JF - Computer Graphics Forum N2 - We introduce techniques for the processing of motion and animations of non-rigid shapes. The idea is to regard animations of deformable objects as curves in shape space. Then, we use the geometric structure on shape space to transfer concepts from curve processing in Rn to the processing of motion of non-rigid shapes. Following this principle, we introduce a discrete geometric flow for curves in shape space. The flow iteratively replaces every shape with a weighted average shape of a local neighborhood and thereby globally decreases an energy whose minimizers are discrete geodesics in shape space. Based on the flow, we devise a novel smoothing filter for motions and animations of deformable shapes. By shortening the length in shape space of an animation, it systematically regularizes the deformations between consecutive frames of the animation. The scheme can be used for smoothing and noise removal, e.g., for reducing jittering artifacts in motion capture data. We introduce a reduced-order method for the computation of the flow. In addition to being efficient for the smoothing of curves, it is a novel scheme for computing geodesics in shape space. We use the scheme to construct non-linear Bézier curves by executing de Casteljau's algorithm in shape space. Y1 - 2016 U6 - https://doi.org/10.1111/cgf.12832 VL - 35 IS - 2 ER - TY - CHAP A1 - Hanik, Martin A1 - Hege, Hans-Christian A1 - von Tycowicz, Christoph T1 - A Nonlinear Hierarchical Model for Longitudinal Data on Manifolds T2 - 2022 IEEE 19th International Symposium on Biomedical Imaging (ISBI) N2 - Large longitudinal studies provide lots of valuable information, especially in medical applications. A problem which must be taken care of in order to utilize their full potential is that of correlation between intra-subject measurements taken at different times. For data in Euclidean space this can be done with hierarchical models, that is, models that consider intra-subject and between-subject variability in two different stages. Nevertheless, data from medical studies often takes values in nonlinear manifolds. Here, as a first step, geodesic hierarchical models have been developed that generalize the linear ansatz by assuming that time-induced intra-subject variations occur along a generalized straight line in the manifold. However, this is often not the case (e.g., periodic motion or processes with saturation). We propose a hierarchical model for manifold-valued data that extends this to include trends along higher-order curves, namely Bézier splines in the manifold. To this end, we present a principled way of comparing shape trends in terms of a functional-based Riemannian metric. Remarkably, this metric allows efficient, yet simple computations by virtue of a variational time discretization requiring only the solution of regression problems. We validate our model on longitudinal data from the osteoarthritis initiative, including classification of disease progression. Y1 - 2022 U6 - https://doi.org/10.1109/ISBI52829.2022.9761465 SP - 1 EP - 5 ER - TY - GEN A1 - Ambellan, Felix A1 - Hanik, Martin A1 - von Tycowicz, Christoph T1 - Morphomatics: Geometric morphometrics in non-Euclidean shape spaces N2 - Morphomatics is an open-source Python library for (statistical) shape analysis developed within the geometric data analysis and processing research group at Zuse Institute Berlin. It contains prototype implementations of intrinsic manifold-based methods that are highly consistent and avoid the influence of unwanted effects such as bias due to arbitrary choices of coordinates. KW - shape analysis KW - geometric statistics KW - geometric morphometrics Y1 - 2021 U6 - https://doi.org/10.12752/8544 N1 - https://morphomatics.github.io/ ER - TY - JOUR A1 - Oehme, Stephan A1 - Moewis, Philippe A1 - Boeth, Heide A1 - Bartek, Benjamin A1 - von Tycowicz, Christoph A1 - Ehrig, Rainald A1 - Duda, Georg A1 - Jung, Tobias T1 - Altered knee kinematics after posterior cruciate single-bundle reconstruction - a comprehensive prospective biomechanical in vivo analysis JF - Frontiers in Bioengineering and Biotechnology Y1 - 2024 U6 - https://doi.org/10.3389/fbioe.2024.1322136 VL - 12 ER - TY - JOUR A1 - Dietrich, Laura A1 - von Tycowicz, Christoph A1 - Brandl, Michael A1 - Mayer, Julius A1 - Baunack, Lohengrin A1 - Schmidt, Iris T1 - Project WEAR: Developing a methodological framework for functional analysis on stone tools through controlled experiments and computational modelling of shape transformations through use JF - Antiquity N2 - The WEAR project is developing an integrative methodology to analyse and predict use-related shape transformation of Neolithic stone axes from Central Europe with mathematical methods and experimental archaeology. Y1 - 2026 ER - TY - JOUR A1 - Veldhuijzen, Ben A1 - Veltkamp, Remco C. A1 - Ikne, Omar A1 - Allaert, Benjamin A1 - Wannous, Hazem A1 - Emporio, Marco A1 - Giachetti, Andrea A1 - LaViola Jr, Joseph J. A1 - He, Ruiwen A1 - Benhabiles, Halim A1 - Cabani, Adnane A1 - Fleury, Anthony A1 - Hammoudi, Karim A1 - Gavalas, Konstantinos A1 - Vlachos, Christoforos A1 - Papanikolaou, Athanasios A1 - Romanelis, Ioannis A1 - Fotis, Vlassis A1 - Arvanitis, Gerasimos A1 - Moustakas, Konstantinos A1 - Hanik, Martin A1 - Nava-Yazdani, Esfandiar A1 - von Tycowicz, Christoph T1 - SHREC 2024: Recognition Of Dynamic Hand Motions Molding Clay JF - Computers & Graphics N2 - Gesture recognition is a tool to enable novel interactions with different techniques and applications, like Mixed Reality and Virtual Reality environments. With all the recent advancements in gesture recognition from skeletal data, it is still unclear how well state-of- the-art techniques perform in a scenario using precise motions with two hands. This paper presents the results of the SHREC 2024 contest organized to evaluate methods for their recognition of highly similar hand motions using the skeletal spatial coordinate data of both hands. The task is the recognition of 7 motion classes given their spatial coordinates in a frame-by-frame motion. The skeletal data has been captured using a Vicon system and pre-processed into a coordinate system using Blender and Vicon Shogun Post. We created a small, novel dataset with a high variety of durations in frames. This paper shows the results of the contest, showing the techniques created by the 5 research groups on this challenging task and comparing them to our baseline method. Y1 - 2024 U6 - https://doi.org/10.1016/j.cag.2024.104012 VL - 123 SP - 104012 ER - TY - JOUR A1 - Mayer, Julius A1 - Baum, Daniel A1 - Ambellan, Felix A1 - von Tycowicz, Christoph A1 - for the Alzheimer’s Disease Neuroimaging Initiative, T1 - Shape-based Disease Grading via Functional Maps and Graph Convolutional Networks with Application to Alzheimer’s Disease JF - BMC Medical Imaging N2 - Shape analysis provides methods for understanding anatomical structures extracted from medical images. However, the underlying notions of shape spaces that are frequently employed come with strict assumptions prohibiting the analysis of incomplete and/or topologically varying shapes. This work aims to alleviate these limitations by adapting the concept of functional maps. Further, we present a graph-based learning approach for morphometric classification of disease states that uses novel shape descriptors based on this concept. We demonstrate the performance of the derived classifier on the open-access ADNI database differentiating normal controls and subjects with Alzheimer’s disease. Notably, the experiments show that our approach can improve over state-of-the-art from geometric deep learning. Y1 - 2024 U6 - https://doi.org/10.1186/s12880-024-01513-z VL - 24 ER - TY - GEN A1 - Nava-Yazdani, Esfandiar A1 - Hege, Hans-Christian A1 - von Tycowicz, Christoph T1 - A Hierarchical Geodesic Model for Longitudinal Analysis on Manifolds N2 - 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. T3 - ZIB-Report - 21-39 KW - Longitudinal KW - Hierarchical Y1 - 2021 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-85187 SN - 1438-0064 N1 - sumbitted to: Journal of Mathematical Imaging and Vision ER - TY - CHAP A1 - Türkseven, Doğa A1 - Rekik, Islem A1 - von Tycowicz, Christoph A1 - Hanik, Martin T1 - Predicting Shape Development: A Riemannian Method T2 - Shape in Medical Imaging N2 - Predicting the future development of an anatomical shape from a single baseline observation is a challenging task. But it can be essential for clinical decision-making. Research has shown that it should be tackled in curved shape spaces, as (e.g., disease-related) shape changes frequently expose nonlinear characteristics. We thus propose a novel prediction method that encodes the whole shape in a Riemannian shape space. It then learns a simple prediction technique founded on hierarchical statistical modeling of longitudinal training data. When applied to predict the future development of the shape of the right hippocampus under Alzheimer's disease and to human body motion, it outperforms deep learning-supported variants as well as state-of-the-art. Y1 - 2023 U6 - https://doi.org/10.1007/978-3-031-46914-5_17 SP - 211 EP - 222 PB - Springer Nature ER - TY - JOUR A1 - Hanik, Martin A1 - Ducke, Benjamin A1 - Hege, Hans-Christian A1 - Fless, Friederike A1 - von Tycowicz, Christoph T1 - Intrinsic shape analysis in archaeology: A case study on ancient sundials JF - Journal on Computing and Cultural Heritage N2 - The fact that the physical shapes of man-made objects are subject to overlapping influences—such as technological, economic, geographic, and stylistic progressions—holds great information potential. On the other hand, it is also a major analytical challenge to uncover these overlapping trends and to disentagle them in an unbiased way. This paper explores a novel mathematical approach to extract archaeological insights from ensembles of similar artifact shapes. We show that by considering all shape information in a find collection, it is possible to identify shape patterns that would be difficult to discern by considering the artifacts individually or by classifying shapes into predefined archaeological types and analyzing the associated distinguishing characteristics. Recently, series of high-resolution digital representations of artifacts have become available. Such data sets enable the application of extremely sensitive and flexible methods of shape analysis. We explore this potential on a set of 3D models of ancient Greek and Roman sundials, with the aim of providing alternatives to the traditional archaeological method of “trend extraction by ordination” (typology). In the proposed approach, each 3D shape is represented as a point in a shape space—a high-dimensional, curved, non-Euclidean space. Proper consideration of its mathematical properties reduces bias in data analysis and thus improves analytical power. By performing regression in shape space, we find that for Roman sundials, the bend of the shadow-receiving surface of the sundials changes with the latitude of the location. This suggests that, apart from the inscribed hour lines, also a sundial’s shape was adjusted to the place of installation. As an example of more advanced inference, we use the identified trend to infer the latitude at which a sundial, whose location of installation is unknown, was placed. We also derive a novel method for differentiated morphological trend assertion, building upon and extending the theory of geometric statistics and shape analysis. Specifically, we present a regression-based method for statistical normalization of shapes that serves as a means of disentangling parameter-dependent effects (trends) and unexplained variability. In addition, we show that this approach is robust to noise in the digital reconstructions of the artifact shapes. Y1 - 2023 U6 - https://doi.org/10.1145/3606698 VL - 16 IS - 4 SP - 1 EP - 26 ER - TY - CHAP A1 - Stokke, Jo Andersson A1 - Bergmann, Ronny A1 - Hanik, Martin A1 - von Tycowicz, Christoph T1 - p-Laplacians for Manifold-valued Hypergraphs T2 - Geometric Science of Information. GSI 2025 N2 - Hypergraphs extend traditional graphs by enabling the representation of N-ary relationships through higher-order edges. Akin to a common approach of deriving graph Laplacians, we define function spaces and corresponding symmetric products on the nodes and edges to derive hypergraph Laplacians. While this has been done before for Euclidean features, this work generalizes previous hypergraph Laplacian approaches to accommodate manifold-valued hypergraphs for many commonly encountered manifolds. Y1 - 2025 U6 - https://doi.org/10.1007/978-3-032-03924-8_17 VL - 16035 ER - TY - CHAP A1 - Maignant, Elodie A1 - Conrad, Tim A1 - von Tycowicz, Christoph T1 - Tree inference with varifold distances T2 - Geometric Science of Information. GSI 2025 N2 - In this paper, we consider a tree inference problem motivated by the critical problem in single-cell genomics of reconstructing dynamic cellular processes from sequencing data. In particular, given a population of cells sampled from such a process, we are interested in the problem of ordering the cells according to their progression in the process. This is known as trajectory inference. If the process is differentiation, this amounts to reconstructing the corresponding differentiation tree. One way of doing this in practice is to estimate the shortest-path distance between nodes based on cell similarities observed in sequencing data. Recent sequencing techniques make it possible to measure two types of data: gene expression levels, and RNA velocity, a vector that predicts changes in gene expression. The data then consist of a discrete vector field on a (subset of a) Euclidean space of dimension equal to the number of genes under consideration. By integrating this velocity field, we trace the evolution of gene expression levels in each single cell from some initial stage to its current stage. Eventually, we assume that we have a faithful embedding of the differentiation tree in a Euclidean space, but which we only observe through the curves representing the paths from the root to the nodes. Using varifold distances between such curves, we define a similarity measure between nodes which we prove approximates the shortest-path distance in a tree that is isomorphic to the target tree. Y1 - 2025 U6 - https://doi.org/10.1007/978-3-032-03921-7_30 VL - 16034 ER -