Procedings of the British Machine Vision Conference 2016 2016
DOI: 10.5244/c.30.21
|View full text |Cite
|
Sign up to set email alerts
|

An Octree-Based Approach towards Efficient Variational Range Data Fusion

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.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 22 publications
0
6
0
Order By: Relevance
“…One of the most popular space partitioning structures on voxel grids are octrees [31] which have been widely adopted due to their flexible and hierarchical structure. Areas of application include depth fusion [24], image rendering [27] and 3D reconstruction [45]. In this paper, we propose 3D convolutional networks on octrees to learn representations from high resolution 3D data.…”
Section: Octree Networkmentioning
confidence: 99%
See 1 more Smart Citation
“…One of the most popular space partitioning structures on voxel grids are octrees [31] which have been widely adopted due to their flexible and hierarchical structure. Areas of application include depth fusion [24], image rendering [27] and 3D reconstruction [45]. In this paper, we propose 3D convolutional networks on octrees to learn representations from high resolution 3D data.…”
Section: Octree Networkmentioning
confidence: 99%
“…Network Architectures ModelNet10 Classification: OctNet1 24) conv(16, 24) conv(16, 24) conv(16, 24) conv(24, 24) conv(24, 24) conv(24, 24) conv(24,24) …”
mentioning
confidence: 99%
“…To increase the geometric resolution, Laine et al [24] proposed a novel compression technique where the voxel data are augmented for the sparse octree to give smooth surfaces and greater geometric detail. Variational range data are fused by proposing dynamic octree partition for volume-based object reconstruction in [61]. A similar approach was proposed by Tatarchenko et al [22]; an octree generating deep convolutional decoder was proposed to reconstruct highresolution 3D shapes.…”
Section: Related Workmentioning
confidence: 99%
“…Although the computational power of GPU-based CNNs has significantly improved recently, in contrast, the training time and computational issues are the main constraints of voxel-based 3D volumetric data that limit the use of high-volume resolutions and going for deeper networks. e octree-based volumetric representation started gaining popularity by researchers because it reduced computational overhead [21][22][23][24]. However, octree representation performs better to preserve the fine details of the 3D object and the smoothness of the 3D object's surface in comparison to voxel representation.…”
Section: Introductionmentioning
confidence: 99%
“…To avoid the limitation of voxel representations, deep learning on 3D sparse data using octree structured 3D data provides very promising results for 3D shape analysis [20], [21]. Riegler at el.…”
Section: A Deep Neural Network For 3d Object Classificationmentioning
confidence: 99%