We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published byOscar Dimit
Modified over 2 years ago
Pratik Agarwal and Edwin Olson University of Freiburg and University of Michigan Variable reordering strategies for SLAM
Graph based SLAM Good ordering Bad ordering 24 times more zeros
Graph based SLAM Reorder
Reordering = =
Reordering is essential for SLAM Bad ordering 10s Good ordering 0.1s Good ordering 100 times faster
Exact minimum degree (EMD) Remove node with min edges Connect neighbors
Our method: bucket heap AMD Advantage over EMD: Single query - multiple vertex elimination How? Lists of vertices with similar #edges
BHAMD in action
Multiple vertices eliminated
BHAMD on a 10,000 node graph EMD - 10,000 steps BHAMD - 107 steps Max heap size in BHAMD 42
State-of-the-art techniques AMD Approximate Minimum Degree COLAMD Column Approximate Minimum Degree NESDIS Nested Dissection METIS Serial Graph Partition
Evaluation – reordering time EMD is slowest
Evaluation – solve time
Further room for improvement? maximum improvement of 0.5% (with 1 week compute time)
Conclusion 1.All methods comparable EMD & COLAMD on A 2.BHAMD - simple yet competitive 3.Negligible improvement with small changes
Reordering matrix - P
Toy example Good ordering Bad ordering
Multiple Min Degree (MMD) vs BHAMD Similarity multiple elimination Difference MMD computes and eliminates independent nodes MMD is still exact unlike BHAMD
But I use CSparse with COLAMD It calls AMD if the matrix is PSD Be careful when opening the box
Graph based SLAM Good ordering Bad ordering 24 times sparser
CS 290H Administrivia: May 14, 2008 Course project progress reports due next Wed 21 May. Reading in Saad (second edition): Sections
Approximation Algorithms for NP-hard Combinatorial Problems Magnús M. Halldórsson Reykjavik University Local Search, Greedy and Partitioning
Siddharth Choudhary. Refines a visual reconstruction to produce jointly optimal 3D structure and viewing parameters ‘bundle’ refers to the bundle.
Evaluating Graph Coloring on GPUs Pascal Grosset, Peihong Zhu, Shusen Liu, Suresh Venkatasubramanian, and Mary Hall Final Project for the GPU class - Spring.
Solution of Sparse Linear Systems
Soham Uday Mehta. Linear Programming in 3 variables.
Is the shape below a function? Explain. Find the domain and range.
1 Solving Quadratic Equations 1Shaw 2008 February 16, 2010.
Finding a maximum independent set in a sparse random graph Uriel Feige and Eran Ofek.
Totally Unimodular Matrices
Find the solutions. Find the Vertex and Max (-1, 0) (5, 0) (2, 10)
The CORS method Selecting the roots of a system of polynomial equations with combinatorial optimization H. Bekker E.P. Braad B. Goldengorin University.
Class Opener: Solve each equation for Y: 1.3x + y = y = 2x 3.x + 2y = 5 4. x – y = x + 3y = x – 5y = -3.
1cs542g-term Sparse matrix data structure Typically either Compressed Sparse Row (CSR) or Compressed Sparse Column (CSC) Informally “ia-ja” format.
NEW APPROACH TO CALCULATION OF RANGE OF POLYNOMIALS USING BERNSTEIN FORMS.
CS 290H Lecture 15 GESP concluded Final presentations for survey projects next Tue and Thu 20-minute talk with at least 5 min for questions and discussion.
1) Find and label the degree of each vertex in the graph.
Quadratic Functions Objectives: Graph a Quadratic Function using Transformations Identify the Vertex and Axis of Symmetry of a Quadratic Function Graph.
Chapter 3 Section 4 Linear Programming Algebra 2 January 29, 2009.
1.5 Graph Theory. Graph Theory The Branch of mathematics in which graphs and networks are used to solve problems.
© 2017 SlidePlayer.com Inc. All rights reserved.