About

Log in?

DTU users get better search results including licensed content and discounts on order fees.

Anyone can log in and get personalized features such as favorites, tags and feeds.

Log in as DTU user Log in as non-DTU user No thanks

DTU Findit

Conference paper

Surfel Based Geometry Resonstruction

In Theory and Practice of Computer Graphics 2010 — 2010, pp. 39-44
From

Image Analysis and Computer Graphics, Department of Informatics and Mathematical Modeling, Technical University of Denmark1

Department of Informatics and Mathematical Modeling, Technical University of Denmark2

We propose a method for retrieving a piecewise smooth surface from noisy data. In data acquired by a scanning process sampled points are almost never on the discontinuities making reconstruction of surfaces with sharp features difficult. Our method is based on a Markov Random Field (MRF) formulation of a surface prior, with the surface represented as a collection of small planar patches, the surfels, associated with each data point.

The main advantage of using surfels is that we avoid treating data points as vertices. MRF formulation of the surface prior allows us to separately model the likelihood (related to the mesh formation process) and the local surface properties. We chose to model the smoothness by considering two terms: the parallelism between neighboring surfels, and their overlap.

We have demonstrated the feasibility of this approach on both synthetical and scanned data. In both cases sharp features were precisely located and planar regions smoothed.

Language: English
Publisher: Eurographics Association
Year: 2010
Pages: 39-44
Proceedings: Theory and Practice of Computer Graphics
Journal subtitle: Eurographics Uk Chapter Proceedings
ISBN: 3905673754 and 9783905673753
Types: Conference paper
ORCIDs: Andersen, Vedrana , Aanæs, Henrik and Bærentzen, Jakob Andreas

DTU users get better search results including licensed content and discounts on order fees.

Log in as DTU user

Access

Analysis