Differences

This shows you the differences between two versions of the page.

--- teaching:meeting:notes:2020-06-18 [2020/06/18 15:42]
Maolin Gao
+++ teaching:meeting:notes:2020-06-18 [2020/06/18 15:43] (current)
Maolin Gao
@@ Line 31: / Line 31: @@
 == Bundle Adjustment on a Graph Processor ==
-A novel way to solve Localization and Mapping problem distributedly is proposed. The factor graph representation of bundle adjustment is adopted and an existing graph algorithm coined "Bielf Propagation" is proposed to solve the graph inference problem. They show >20x speedup of the proposed method running on IPU [[https://www.graphcore.ai/products/ipu | link]], than traditional bundle adjustment on cpu.
+A novel way to solve Localization and Mapping problem distributedly is proposed. The factor graph representation of bundle adjustment is adopted and an existing graph algorithm coined "Bielf Propagation" is proposed to solve the graph inference problem. They show >20x speedup of the proposed method running on IPU [[https://www.graphcore.ai/products/ipu | link]], than traditional bundle adjustment on CPU.
 [[https://arxiv.org/abs/2003.03134|paper]] [[https://www.youtube.com/watch?v=TqeN8aQNgd0|Teaser]]

Technical University of Munich