TR2011-042

A Fast Bilinear Structure from Motion Algorithm Using a Video Sequence and Inertial Sensors


    •  Ramachandran, M., Veeraraghavan, A., Chellappa, R., "A Fast Bilinear Structure from Motion Algorithm Using a Video Sequence and Inertial Sensors", IEEE Transactions on Pattern Analysis and Machine Intelligence, ISSN: 0162-8828, Vol. 33, No. 1, pp. 186-193, January 2011.
      BibTeX Download PDF
      • @article{Ramachandran2011jan,
      • author = {Ramachandran, M. and Veeraraghavan, A. and Chellappa, R.},
      • title = {A Fast Bilinear Structure from Motion Algorithm Using a Video Sequence and Inertial Sensors},
      • journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
      • year = 2011,
      • volume = 33,
      • number = 1,
      • pages = {186--193},
      • month = jan,
      • issn = {0162-8828},
      • url = {https://www.merl.com/publications/TR2011-042}
      • }
  • Research Area:

    Computer Vision


In this paper, we study the benefits of the availability of a specific form of additional information, the vertical direction (gravity) and the height of the camera, both of which can be conveniently measured using inertial sensors and a monocular video sequence for 3D urban modeling. We show that in the presence of this information, the SfM equations can be rewritten in a bilinear form. This allows us to derive a fast, robust, and scalable SfM algorithm for large scale applications. The SfM algorithm developed in this paper is experimentally demonstrated to have favorable properties compared to the sparse bundle adjustment algorithm. We provide experimental evidence indicating that the proposed algorithm converges in many cases to solutions with lower error than state-of-art implementations of bundle adjustment. We also demonstrate that for the case of large reconstruction problems, the proposed algorithm takes lesser time to reach its solution compared to bundle adjustment. We also present SfM results using our algorithm on the Google Street View research data set.