By Topic

Robust Global Feature Based Data Association With a Sparse Bit Optimized Maximum Clique Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Pablo San Segundo ; Center of Automation and Robotics , Universidad Politécnica de Madrid-Consejo Superior de Investigaciones Científicas , Madrid, Spain ; Diego Rodriguez-Losada

This paper presents a robust solution to the mobile robotics data association problem based on solving the maximum clique problem (MCP) in a typically sparse correspondence graph, which contains compatibility information between pairs of observations and landmarks. Bit sparse optimizations are designed and implemented in a new algorithm BBMCS, which reduces computation and memory requirements of a leading general purpose maximum clique solver, to make it possibly the best exact sparse MCP algorithm currently found in the literature. BBMCS is reported to achieve very good results in terms of robustness with few assumptions on noise and visibility, while managing very reasonable computation time and memory usage even for complex large data association problems.

Published in:

IEEE Transactions on Robotics  (Volume:29 ,  Issue: 5 )