Generalized connectivity constraints for spatio-temporal 3D reconstruction

21Citations
Citations of this article
41Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper introduces connectivity preserving constraints into spatio-temporal multi-view reconstruction. We efficiently model connectivity constraints by precomputing a geodesic shortest path tree on the occupancy likelihood. Connectivity of the final occupancy labeling is ensured with a set of linear constraints on the labeling function. In order to generalize the connectivity constraints from objects with genus 0 to an arbitrary genus, we detect loops by analyzing the visual hull of the scene. A modification of the constraints ensures connectivity in the presence of loops. The proposed efficient implementation adds little runtime and memory overhead to the reconstruction method. Several experiments show significant improvement over state-of-the-art methods and validate the practical use of this approach in scenes with fine structured details. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

Oswald, M. R., Stühmer, J., & Cremers, D. (2014). Generalized connectivity constraints for spatio-temporal 3D reconstruction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8692 LNCS, pp. 32–46). Springer Verlag. https://doi.org/10.1007/978-3-319-10593-2_3

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