2 papers
cs.CV2020
Fast Convex Relaxations using Graph Discretizations
Jonas Geiping, Fjedor Gaede, Hartmut Bauermeister +1
Matching and partitioning problems are fundamentals of computer vision applications with examples in multilabel segmentation, stereo estimation and optical-flow computation. These…
math.NA2019
Variational Graph Methods for Efficient Point Cloud Sparsification
Daniel Tenbrinck, Fjedor Gaede, Martin Burger
In recent years new application areas have emerged in which one aims to capture the geometry of objects by means of three-dimensional point clouds. Often the obtained data consist…