@article{NavaYazdaniHegeSullivanetal.2020, author = {Nava-Yazdani, Esfandiar and Hege, Hans-Christian and Sullivan, T. J. and von Tycowicz, Christoph}, title = {Geodesic Analysis in Kendall's Shape Space with Epidemiological Applications}, volume = {62}, journal = {Journal of Mathematical Imaging and Vision}, number = {4}, arxiv = {http://arxiv.org/abs/1906.11950}, doi = {10.1007/s10851-020-00945-w}, pages = {549 -- 559}, year = {2020}, abstract = {We analytically determine Jacobi fields and parallel transports and compute geodesic regression in Kendall's shape space. Using the derived expressions, we can fully leverage the geometry via Riemannian optimization and thereby reduce the computational expense by several orders of magnitude over common, nonlinear constrained approaches. The methodology is demonstrated by performing a longitudinal statistical analysis of epidemiological shape data. As an example application we have chosen 3D shapes of knee bones, reconstructed from image data of the Osteoarthritis Initiative (OAI). Comparing subject groups with incident and developing osteoarthritis versus normal controls, we find clear differences in the temporal development of femur shapes. This paves the way for early prediction of incident knee osteoarthritis, using geometry data alone.}, language = {en} } @article{AmbellanZachowvonTycowicz2021, author = {Ambellan, Felix and Zachow, Stefan and von Tycowicz, Christoph}, title = {Rigid Motion Invariant Statistical Shape Modeling based on Discrete Fundamental Forms}, volume = {73}, journal = {Medical Image Analysis}, arxiv = {http://arxiv.org/abs/2111.06850}, doi = {10.1016/j.media.2021.102178}, year = {2021}, abstract = {We present a novel approach for nonlinear statistical shape modeling that is invariant under Euclidean motion and thus alignment-free. By analyzing metric distortion and curvature of shapes as elements of Lie groups in a consistent Riemannian setting, we construct a framework that reliably handles large deformations. Due to the explicit character of Lie group operations, our non-Euclidean method is very efficient allowing for fast and numerically robust processing. This facilitates Riemannian analysis of large shape populations accessible through longitudinal and multi-site imaging studies providing increased statistical power. Additionally, as planar configurations form a submanifold in shape space, our representation allows for effective estimation of quasi-isometric surfaces flattenings. We evaluate the performance of our model w.r.t. shape-based classification of hippocampus and femur malformations due to Alzheimer's disease and osteoarthritis, respectively. In particular, we achieve state-of-the-art accuracies outperforming the standard Euclidean as well as a recent nonlinear approach especially in presence of sparse training data. To provide insight into the model's ability of capturing biological shape variability, we carry out an analysis of specificity and generalization ability.}, language = {en} } @article{SchulzTycowiczSeideletal.2014, author = {Schulz, Christian and Tycowicz, Christoph von and Seidel, Hans-Peter and Hildebrandt, Klaus}, title = {Animating Deformable Objects Using Sparse Spacetime Constraints}, volume = {33}, journal = {ACM Transactions on Graphics}, number = {4}, doi = {10.1145/2601097.2601156}, pages = {109:1 -- 109:10}, year = {2014}, abstract = {We propose a scheme for animating deformable objects based on spacetime optimization. The main feature is that it robustly and quickly (within a few seconds) generates interesting motion from a sparse set of spacetime constraints. Providing only partial (as opposed to full) keyframes for positions and velocities is sufficient. The computed motion satisfies the constraints and the remaining degrees of freedom are determined by physical principles using elasticity and the spacetime constraints paradigm. Our modeling of the spacetime optimization problem combines dimensional reduction, modal coordinates, wiggly splines, and rotation strain warping. Controlling the warped motion requires the derivative of the warp map. We derive a representation of the derivative that can be efficiently and robustly evaluated. Our solver is based on a theorem that characterizes the solutions of the optimization problem and allows us to restrict the optimization to very low-dimensional search spaces. This treatment of the optimization problem avoids a time discretization and the resulting method can robustly deal with sparse input and wiggly motion.}, language = {en} } @article{TycowiczSchulzSeideletal.2013, author = {Tycowicz, Christoph von and Schulz, Christian and Seidel, Hans-Peter and Hildebrandt, Klaus}, title = {An Efficient Construction of Reduced Deformable Objects}, volume = {32}, journal = {ACM Transactions on Graphics}, number = {6}, publisher = {ACM}, doi = {10.1145/2508363.2508392}, pages = {213:1 -- 213:10}, year = {2013}, abstract = {Many efficient computational methods for physical simulation are based on model reduction. We propose new model reduction techniques for the approximation of reduced forces and for the construction of reduced shape spaces of deformable objects that accelerate the construction of a reduced dynamical system, increase the accuracy of the approximation, and simplify the implementation of model reduction. Based on the techniques, we introduce schemes for real-time simulation of deformable objects and interactive deformation-based editing of triangle or tet meshes. We demonstrate the effectiveness of the new techniques in different experiments with elastic solids and shells and compare them to alternative approaches.}, language = {en} } @article{HildebrandtSchulzTycowiczetal.2012, author = {Hildebrandt, Klaus and Schulz, Christian and Tycowicz, Christoph von and Polthier, Konrad}, title = {Interactive spacetime control of deformable objects}, volume = {31}, journal = {ACM Transactions on Graphics}, number = {4}, publisher = {ACM}, doi = {10.1145/2185520.2185567}, pages = {71:1 -- 71:8}, year = {2012}, abstract = {Creating motions of objects or characters that are physically plausible and follow an animator's intent is a key task in computer animation. The spacetime constraints paradigm is a valuable approach to this problem, but it suffers from high computational costs. Based on spacetime constraints, we propose a technique that controls the motion of deformable objects and offers an interactive response. This is achieved by a model reduction of the underlying variational problem, which combines dimension reduction, multipoint linearization, and decoupling of ODEs. After a preprocess, the cost for creating or editing a motion is reduced to solving a number of one-dimensional spacetime problems, whose solutions are the wiggly splines introduced by Kass and Anderson [2008]. We achieve interactive response using a new fast and robust numerical scheme for solving a set of one-dimensional problems based on an explicit representation of the wiggly splines.}, language = {en} } @article{HildebrandtSchulzTycowiczetal.2011, author = {Hildebrandt, Klaus and Schulz, Christian and Tycowicz, Christoph von and Polthier, Konrad}, title = {Interactive surface modeling using modal analysis}, volume = {30}, journal = {ACM Transactions on Graphics}, number = {5}, doi = {10.1145/2019627.2019638}, pages = {119:1 -- 119:11}, year = {2011}, abstract = {We propose a framework for deformation-based surface modeling that is interactive, robust and intuitive to use. The deformations are described by a non-linear optimization problem that models static states of elastic shapes under external forces which implement the user input. Interactive response is achieved by a combination of model reduction, a robust energy approximation, and an efficient quasi-Newton solver. Motivated by the observation that a typical modeling session requires only a fraction of the full shape space of the underlying model, we use second and third derivatives of a deformation energy to construct a low-dimensional shape space that forms the feasible set for the optimization. Based on mesh coarsening, we propose an energy approximation scheme with adjustable approximation quality. The quasi-Newton solver guarantees superlinear convergence without the need of costly Hessian evaluations during modeling. We demonstrate the effectiveness of the approach on different examples including the test suite introduced in [Botsch and Sorkine 2008].}, language = {en} } @article{HildebrandtSchulzTycowiczetal.2012, author = {Hildebrandt, Klaus and Schulz, Christian and Tycowicz, Christoph von and Polthier, Konrad}, title = {Modal Shape Analysis beyond Laplacian}, volume = {29}, journal = {Computer Aided Geometric Design}, number = {5}, doi = {10.1016/j.cagd.2012.01.001}, pages = {204 -- 2018}, year = {2012}, abstract = {In recent years, substantial progress in shape analysis has been achieved through methods that use the spectra and eigenfunctions of discrete Laplace operators. In this work, we study spectra and eigenfunctions of discrete differential operators that can serve as an alternative to the discrete Laplacians for applications in shape analysis. We construct such operators as the Hessians of surface energies, which operate on a function space on the surface, or of deformation energies, which operate on a shape space. In particular, we design a quadratic energy such that, on the one hand, its Hessian equals the Laplace operator if the surface is a part of the Euclidean plane, and, on the other hand, the Hessian eigenfunctions are sensitive to the extrinsic curvature (e.g. sharp bends) on curved surfaces. Furthermore, we consider eigenvibrations induced by deformation energies, and we derive a closed form representation for the Hessian (at the rest state of the energy) for a general class of deformation energies. Based on these spectra and eigenmodes, we derive two shape signatures. One that measures the similarity of points on a surface, and another that can be used to identify features of surfaces.}, language = {en} } @article{TycowiczKaelbererPolthier2011, author = {Tycowicz, Christoph von and K{\"a}lberer, Felix and Polthier, Konrad}, title = {Context-based Coding of Adaptive Multiresolution Meshes}, volume = {30}, journal = {Computer Graphics Forum}, number = {8}, doi = {10.1111/j.1467-8659.2011.01972.x}, pages = {2231 -- 2245}, year = {2011}, abstract = {Multiresolution meshes provide an efficient and structured representation of geometric objects. To increase the mesh resolution only at vital parts of the object, adaptive refinement is widely used. We propose a lossless compression scheme for these adaptive structures that exploits the parent-child relationships inherent to the mesh hierarchy. We use the rules that correspond to the adaptive refinement scheme and store bits only where some freedom of choice is left, leading to compact codes that are free of redundancy. Moreover, we extend the coder to sequences of meshes with varying refinement. The connectivity compression ratio of our method exceeds that of state-of-the-art coders by a factor of 2 to 7. For efficient compression of vertex positions we adapt popular wavelet-based coding schemes to the adaptive triangular and quadrangular cases to demonstrate the compatibility with our method. Akin to state-of-the-art coders, we use a zerotree to encode the resulting coefficients. Using improved context modeling we enhanced the zerotree compression, cutting the overall geometry data rate by 7\% below those of the successful Progressive Geometry Compression. More importantly, by exploiting the existing refinement structure we achieve compression factors that are 4 times greater than those of coders which can handle irregular meshes.}, language = {en} } @article{TycowiczSchulzSeideletal.2015, author = {Tycowicz, Christoph von and Schulz, Christian and Seidel, Hans-Peter and Hildebrandt, Klaus}, title = {Real-time Nonlinear Shape Interpolation}, volume = {34}, journal = {ACM Transactions on Graphics}, number = {3}, doi = {10.1145/2729972}, pages = {34:1 -- 34:10}, year = {2015}, abstract = {We introduce a scheme for real-time nonlinear interpolation of a set of shapes. The scheme exploits the structure of the shape interpolation problem, in particular, the fact that the set of all possible interpolated shapes is a low-dimensional object in a high-dimensional shape space. The interpolated shapes are defined as the minimizers of a nonlinear objective functional on the shape space. Our approach is to construct a reduced optimization problem that approximates its unreduced counterpart and can be solved in milliseconds. To achieve this, we restrict the optimization to a low-dimensional subspace that is specifically designed for the shape interpolation problem. The construction of the subspace is based on two components: a formula for the calculation of derivatives of the interpolated shapes and a Krylov-type sequence that combines the derivatives and the Hessian of the objective functional. To make the computational cost for solving the reduced optimization problem independent of the resolution of the example shapes, we combine the dimensional reduction with schemes for the efficient approximation of the reduced nonlinear objective functional and its gradient. In our experiments, we obtain rates of 20-100 interpolated shapes per second even for the largest examples which have 500k vertices per example shape.}, language = {en} } @article{vonTycowiczAmbellanMukhopadhyayetal.2018, author = {von Tycowicz, Christoph and Ambellan, Felix and Mukhopadhyay, Anirban and Zachow, Stefan}, title = {An Efficient Riemannian Statistical Shape Model using Differential Coordinates}, volume = {43}, journal = {Medical Image Analysis}, number = {1}, doi = {10.1016/j.media.2017.09.004}, pages = {1 -- 9}, year = {2018}, abstract = {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.}, language = {en} } @article{BrandtTycowiczHildebrandt2016, author = {Brandt, Christopher and Tycowicz, Christoph von and Hildebrandt, Klaus}, title = {Geometric Flows of Curves in Shape Space for Processing Motion of Deformable Objects}, volume = {35}, journal = {Computer Graphics Forum}, number = {2}, doi = {10.1111/cgf.12832}, year = {2016}, abstract = {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{\´e}zier curves by executing de Casteljau's algorithm in shape space.}, language = {en} } @article{OehmeMoewisBoethetal.2024, author = {Oehme, Stephan and Moewis, Philippe and Boeth, Heide and Bartek, Benjamin and von Tycowicz, Christoph and Ehrig, Rainald and Duda, Georg and Jung, Tobias}, title = {Altered knee kinematics after posterior cruciate single-bundle reconstruction - a comprehensive prospective biomechanical in vivo analysis}, volume = {12}, journal = {Frontiers in Bioengineering and Biotechnology}, doi = {10.3389/fbioe.2024.1322136}, year = {2024}, language = {en} }