no code implementations • 2 Nov 2022 • Davin Jeong, Allison Gunby-Mann, Sarel Cohen, Maximilian Katzmann, Chau Pham, Arnav Bhakta, Tobias Friedrich, Sang Chin
More specifically, we utilize the combinatorial structure of replacement paths as a concatenation of shortest paths and use deep learning to find the pivot nodes for stitching shortest paths into replacement paths.
1 code implementation • 11 Oct 2021 • Sebastian Angrick, Ben Bals, Niko Hastrich, Maximilian Kleissl, Jonas Schmidt, Vanja Doskoč, Maximilian Katzmann, Louise Molitor, Tobias Friedrich
Human lives are increasingly influenced by algorithms, which therefore need to meet higher standards not only in accuracy but also with respect to explainability.
no code implementations • 5 Feb 2019 • Álvaro Parra, Tat-Jun Chin, Frank Neumann, Tobias Friedrich, Maximilian Katzmann
An alternative approach is to directly search for the subset of correspondences that are pairwise consistent, without optimising the registration function.