Dictionary-based map compression for sparse feature maps

N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Obtaining a compact representation of a large-size feature map built by mapper robots is a critical issue in recent mobile robotics. 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 the proposal of the dictionary-based map compression approach. A map compression system is presented by employing RANSAC map matching and sparse coding as building blocks. The effectiveness levels of the proposed techniques is investigated in terms of map compression ratio, compression speed, the retrieval performance of compressed/ decompressed maps, as well as applications to the Kolmogorov complexity. Copyright © 2012 The Institute of Electronics, Information and Communication Engineers.

Cite

CITATION STYLE

APA

Tanaka, K., & Nagasaka, T. (2012). Dictionary-based map compression for sparse feature maps. IEICE Transactions on Information and Systems, E95-D(2), 604–613. https://doi.org/10.1587/transinf.E95.D.604

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free