TUHH Open Research
Help
  • Log In
    New user? Click here to register.Have you forgotten your password?
  • English
  • Deutsch
  • Communities & Collections
  • Publications
  • Research Data
  • People
  • Institutions
  • Projects
  • Statistics
  1. Home
  2. TUHH
  3. Publication References
  4. Robust stereo visual odometry using iterative closest multiple lines
 
Options

Robust stereo visual odometry using iterative closest multiple lines

Publikationstyp
Conference Paper
Date Issued
2013
Sprache
English
Author(s)
Witt, Jonas  
Weltin, Uwe  
Institut
Zuverlässigkeitstechnik M-24  
TORE-URI
http://hdl.handle.net/11420/5985
Start Page
4164
End Page
4171
Article Number
6696953
Citation
2013 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) : 3 - 7 Nov. 2013, Tokyo, Japan ; conference digest / sponsors IEEE Robotics and Automation Society; IEEE Industrial Electronics Society; the Robotics Society of Japan; ... - Piscataway, NJ : IEEE, 2013. - Art.-Nr. 6696953 i.e. Seite 4164-4171
Contribution to Conference
2013 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 3 - 7 Nov. 2013, Tokyo, Japan  
Publisher DOI
10.1109/IROS.2013.6696953
Scopus ID
2-s2.0-84893763999
Publisher
IEEE
This work is concerned with the matching of straight lines between two stereo image pairs by reprojection. While we will focus on visual odometry in the realm of simultaneous mapping and localization, the techniques are also relevant to monocular and stereo 3D object detection and tracking. Our first contribution is an adaptation of the Iterative Closest Point (ICP) algorithm to the domain of lines. We argue that a naive 'Iterative Closest Line' derivation cannot deliver similar performance. In contrast, our novel Iterative Closest Multiple Lines (ICML) algorithm allows efficient line matching while even reducing the amount of local minima during iterative optimization with its consideration of several weighted matches. The second contribution is a fast and robust hypothesize-and-test algorithm which can act as a fallback for challenging frame pairs where pure gradient-based optimization fails. In several differently textured scenes, we demonstrate robust performance, even in very sparse cases where proven feature point based methods fail. In comparison to edge-point ICP, we see speed improvements of more than an order of a magnitude and reduced susceptibility for local minima. © 2013 IEEE.
DDC Class
004: Informatik
TUHH
Weiterführende Links
  • Contact
  • Send Feedback
  • Cookie settings
  • Privacy policy
  • Impress
DSpace Software

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science
Design by effective webwork GmbH

  • Deutsche NationalbibliothekDeutsche Nationalbibliothek
  • ORCiD Member OrganizationORCiD Member Organization
  • DataCiteDataCite
  • Re3DataRe3Data
  • OpenDOAROpenDOAR
  • OpenAireOpenAire
  • BASE Bielefeld Academic Search EngineBASE Bielefeld Academic Search Engine
Feedback