Mobile Robot Localization using an Incremental Eigenspace Model

When using appearance-based recognition for self-localization of mobile robots, the images obtained during the exploration of the environment need to be efficiently stored in the memory. PCA offers means for representing the images in a low-dimensional subspace, which allows for efficient matching and recognition. For active exploration it is necessary to use an incremental method for the computation of the subspace. We propose to use an incremental PCA algorithm with the updating of partial image representations in a way that allows the robot to discard the acquired images immediately after the update. Such a model is open-ended, meaning that we can easily update it with new images. We show that the performance of the proposed method is comparable to the performance of the batch method in terms of compression, computational cost and the precision of localization. We also show that by applying the repetitive learning, the subspace converges to that constructed with the batch method.

Authors

• Matej Artac
• Matjaz Jogan
• Ales Leonardis

Keywords

• Mobile robots
• Principal component analysis
• Orbital robotics
• Buildings
• Image storage
• Information science
• Image recognition
• Image representation
• Computational efficiency
• Image converters
• Mobile Robot
• Eigenspace
• Mobile Robot Localization
• Computational Cost
• Performance Of Method
• Eigenvectors
• Precise Location
• Partial Representation
• Low-dimensional Subspace
• Representative Way
• Batch Method
• Incremental Algorithm
• Repetitive Learning
• Input Image
• Number Of Images
• Learning Stage
• Local Stage