Manifold based map representation for mobile robot using Euclidean data difference dimension reduction
In this paper, a novel method for mobile robot map representation is presented. We introduce a manifold based map which is constructed by mapping the color histogram of omni-directional camera images into a low dimensional space while preserving local and global geometry. The geometry is preserved using orthogonal and independent feature vectors consisting of the Euclidean data difference and the nearest and farthest neighbor data vectors. The introduced dimension reduction method has shown superior performance compared to LLE and PCA in benchmark data sets providing a hard dimension reduction of 768 into 3. This mapping matrix has been used for real time robot localization and mapping in real world experiments. In large environments, adjacent places share the same set of objects and features therefore dimension reduction may end up in a non-smooth manifold. To apply the method in large environments, first a K-Means method is used to cluster the environment and then each obtained cluster is processed separately. Successful experiments on 7 different data sets show effectiveness of this method for robotic applications such as mapping, visual place classification and kidnaped-robot localization.
manifold based map mapping dimension reduction mobile robot localization