Generalized Image Acquisition and Analysis

BlurTags: Spatially Varying PSF Estimation with Out-of-Focus Patterns

In this paper, we consider the problem of animation reconstruction, i.e., the reconstruction of shape and motion of a deformable object from dynamic 3D scanner data, without using user provided template models. Unlike pre- vious work that addressed this problem, we do not rely on locally conver- gent optimization but present a system that can handle fast motion, tem- porally disrupted input, and can correctly match objects that disappear for extended time periods in acquisition holes due to occlusion. Our approach is motivated by cartography: We first estimate a few landmark correspon- dences, which are extended to a dense matching and then used to recon- struct geometry and motion. We propose a number of algorithmic building blocks: a scheme for tracking landmarks in temporally coherent and inco- herent data, an algorithm for robust estimation of dense correspondences under topological noise, and the integration of local matching techniques to refine the result. We describe and evaluate the individual components and propose a complete animation reconstruction pipeline based on these ideas. We evaluate our method on a number of standard benchmark data sets and show that we can obtain correct reconstructions in situations where other techniques fail completely or require additional user guidance such as a template model.

Projects

Maximum Mipmaps for Fast, Accurate, and Scalable Dynamic Height Field Rendering

Art Tevs, Ivo Ihrke, Hans-Peter Seidel
In: Proceedings of I3D 2008.



Abstract

This paper presents a GPU-based, fast, and accurate dynamic height field rendering technique that scales well to large scale height fields. Current real-time rendering algorithms for dynamic height fields employ approximate ray-height field intersection methods, whereas accurate algorithms require pre-computation in the order of seconds to minutes and are thus not suitable for dynamic height field rendering. We alleviate this problem by using maximum mipmaps, a hierarchical data structure supporting accurate and efficient rendering while simultaneously lowering the pre-computation costs to negligible levels. Furthermore, maximum mipmaps allow for view-dependent level-of-detail rendering. In combination with hierarchical ray-stepping this results in an efficient intersection algorithm for large scale height fields.
Project Page Video Slides

Bibtex

@inproceedings{Tevs08:MMM,
author = {Art Tevs and Ivo Ihrke and Hans-Peter Seidel},
title = {Maximum Mipmaps for Fast, Accurate, and Scalable Dynamic Height Field Rendering},
booktitle = {Symposium on Interactive 3D Graphics and Games (i3D'08)},
year = 2008,
pages = {183--190},
}
Go to project list