会议专题

Dictionary-based Map Compression for Sparse Feature Maps

Obtaining a compact representation of a largesize feature map built by mapper robots is a critical issue in the context of lightweight information sharing as well as Kolmogorov complexity. This map compression problem is explored from a novel perspective of dictionary-based data compression techniques in the paper. The primary contribution of the paper is proposal of the dictionary-based map compression approach. A map compression system is developed using RANSAC map matching and sparse coding as building blocks. Experiments show promising results in terms of map compression ratio, compression speed as well as the retrieval performance of compressed/decompressed maps.

Nagasaka Tomomi Tanaka Kanji

Faculty of Engineering,University of Fukui,Japan

国际会议

2011 IEEE International Conference on Robotics and Automation(2011年IEEE世界机器人与自动化大会 ICRA 2011)

上海

英文

2329-2336

2011-05-09(万方平台首次上网日期,不代表论文的发表时间)