
This page gives a brief introduction to our research group: the people, the research area, and projects we (have been) working on.
|
|
|
The objective of the research group is to investigate statistical data analysis techniques for geometric data sets. As a long term goal, we want to obtain "shape understanding" algorithms that discover and utilize structure in geometric data sets.
There are several motivations for pursuing this research direction:
Currently, the research group is mostly focusing on geometric correspondence problems, which is a key low-level problems. Having correspondences between objects and parts of objects is an important building block that can be used in order to device higher level "shape understanding" algorithms.
XGRT - Extensible Graphics ToolkitXGRT is an object-oriented framework for computer graphics applications, especially in the area of geometry processing. It offers interactive editing of large out-of-core point clouds and a number of geometry processing algorithms. more... |
![]() |
|
Inverse Procedural Modeling Inverse procedural modeling refers to the process of estimating rules how to build a shape from one or more example shapes. In this project, we are looking at fully automatic techniques that can derive shape grammars from single example shapes. We use partial symmetries of an object to find a grammatic that describes a family of shapes that are provably similar to the exemplar in a strict formal sense. Key Publications
|
||||||
|
Symmetry Detection Given a 3D model, we would like to compose this model into elementary building blocks. Each building block consists of the same geometry up to a certain transformation (rigid motion, isometry, more general deformation) and possibly noise. We are looking at algorithms that can compute such decompositions fully automatically, without user supervision. Key Publications
|
||||||
|
Deformable Shape Matching The goal of this project is to find dense correspondences between deformed shapes. We assume that the deformation the shape has undergone is intrinsically isometric, i.e., does not change geodesic distances within the deformed surface. However, we have to address the problem of topological noise (partial data, acquisition holes, apparant connections if for example the hand of a person gets to close to the body). We are looking at algorithms that can perform global isometric shape matching witout prior initialization and under topological noise. Key Publications
|
||||||
|
Animation Reconstruction In this project, we consider sequences of point clouds that shows a deformable shape in motion, as obtained from real-time 3D scanners. This means we have typically acquisition holes so that the shape is only shown partially in each frame. In addition, no correspondence information is given by the data. Our goal is to reconstruct shape and motion simultaneously, including dense correspondences over time and completed geometry in every frame that matches the data and behaves plausibly in unobserved areas. We refer to this problem setting as animation reconstruction. Key Publications
|
||||||
|
Algorithms and Data Structures for Large Scene Modeling In this project we consider the problem of handling large amounts of geometric data. We have developed a new data structure that allows for real-time editing and visualization of large out-of-core 3D data sets, with size limited only by available hard disc space. We have also developed an open and modular system architecture that uses this data structure as an abstract geometric data base to implement a real-time large scene editor application, supporting interactive local editing, various streaming geometry processing algorithms, and large animation sequences. Key Publications
|
||||
|
Statistical Shape Spaces and 3D Reconstruction The goal of this project is to describe statistical probability distributions on shape that assign different likelihoods for different types of shapes. The resulting framework is used to device a Bayesian geometry reconstruction algorith: It infers the most likely original shape given a noisy measurment (in the sense of maximizing the posterior propability density for a given statistic measurment model and user defined shape priors). Key Publications
|
||||
|
Efficient Stochastic Synthesis for 3D Modeling The goal of this project was to investigate the inverse problem: Rather than analysing real-world geometry to detect statistical pattern, we use a generative stochastical model to create objects procedurally. We develop a new hierarchical, bounded support subdivision, multi-channel geometry synthesis technique that is able to create complex, non-stationary fractal objects in an intuitive way. By specifying some simple multi-variate subdivision rules, models ranging from smooth patches to complex landscape models can be created. Due to a GPU implementation, the technique works in real-time, allowing to zoom into objects with virtually infinite detail. Key Publication |