中央研究院 資訊科學研究所

活動訊息

友善列印

列印可使用瀏覽器提供的(Ctrl+P)功能

Generalized Subgraph Preconditioners for Large-Scale Bundle Adjustment

:::

Generalized Subgraph Preconditioners for Large-Scale Bundle Adjustment

  • 講者Yong-Dian Jian 先生 (College of Computing, Georgia Institute of Technology)
    邀請人:陳祝嵩老師
  • 時間2012-01-05 (Thu.) 14:00 ~ 16:00
  • 地點資訊所新館106演講廳
摘要

We present a generalized subgraph preconditioning (GSP) technique to solve large-scale bundle adjustment problems efficiently. In contrast with previous work which uses either direct or iterative methods alone, GSP combines their advantages and is significantly faster on large datasets. The main idea is to identify a sub-problem (subgraph) that can be solved efficiently by sparse factorization methods and use its solution to build a preconditioner for the conjugate gradient method. In addition, GSP is more general and leads to more effective preconditioners. When applying the proposed method to the ``bal'' datasets, we observe that GSP shows promising performance.