Efficient Incremental Map Segmentation in Dense RGB-D Maps

Download: PDF.

“Efficient Incremental Map Segmentation in Dense RGB-D Maps” by R. Finman, T. Whelan, M. Kaess, and J.J. Leonard. In IEEE Intl. Conf. on Robotics and Automation, ICRA, (Hong Kong), June 2014, pp. 5488-5494.


In this paper we present a method for incrementally segmenting large RGB-D maps as they are being created. Recent advances in dense RGB-D mapping have led to maps of increasing size and density. Segmentation of these raw maps is a first step for higher-level tasks such as object detection. Current popular methods of segmentation scale linearly with the size of the map and generally include all points. Our method takes a previously segmented map and segments new data added to that map incrementally online. Segments in the existing map are re-segmented with the new data based on an iterative voting method. Our segmentation method works in maps with loops to combine partial segmentations from each traversal into a complete segmentation model. We verify our algorithm on multiple real-world datasets spanning many meters and millions of points in real-time. We compare our method against a popular batch segmentation method for accuracy and timing complexity.

Download: PDF.

BibTeX entry:

   author = {R. Finman and T. Whelan and M. Kaess and J.J. Leonard},
   title = {Efficient Incremental Map Segmentation in Dense {RGB-D} Maps},
   booktitle = {IEEE Intl. Conf. on Robotics and Automation, ICRA},
   pages = {5488-5494},
   address = {Hong Kong},
   month = jun,
   year = {2014}
Last updated: August 17, 2017