An octree-based approach towards efficient variational range data fusion

2Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.

Abstract

Volume-based reconstruction is usually expensive both in terms of memory consumption and runtime. Especially for sparse geometric structures, volumetric representations produce a huge computational overhead. We present an efficient way to fuse range data via a variational Octree-based minimization approach by taking the actual range data geometry into account. We transform the data into Octree-based truncated signed distance fields and show how the optimization can be conducted on the newly created structures. The main challenge is to uphold speed and a low memory footprint without sacrificing the solutions’ accuracy during optimization. We explain how to dynamically adjust the optimizer’s geometric structure via joining/splitting of Octree nodes and how to define the operators. We evaluate on various datasets and outline the suitability in terms of performance and geometric accuracy.

Cite

CITATION STYLE

APA

Kehl, W., Holl, T., Tombari, F., Ilic, S., & Navab, N. (2016). An octree-based approach towards efficient variational range data fusion. In British Machine Vision Conference 2016, BMVC 2016 (Vol. 2016-September, pp. 21.1-21.12). British Machine Vision Conference, BMVC. https://doi.org/10.5244/C.30.21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free