Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

ICPR
2008
IEEE

favoriteEmaildiscussreport

112views Computer Vision» more ICPR 2008»

On the scalability of robot localization using high-dimensional features

13 years 11 months ago

On the scalability of robot localization using high-dimensional features

Download figment.cse.usf.edu

This study provides an investigation of scalability of mobile robot localization. In recent years, inference algorithms based on map-matching have proved their superior performance in large-scale environments. In this paper, the scalability is augmented by an ANN retrieval of high-dimensional descriptive features. The proposed algorithm is then exhaustively evaluated using largesize real maps, including over 100K feature maps.

Takeshi Ueda, Kanji Tanaka

Real-time Traffic

Computer Vision | ICPR 2008 | Largesize Real Maps | Mobile Robot Localization | Scalability |

claim paper

Related Content

» Auxiliary Particle Filter Robot Localization from HighDimensional Sensor Observations

» Feature Selection for High Dimensional Face Image Using Selforganizing Maps

» Exploiting High Dimensional Video Features Using Layered Gaussian Mixture Models

» CARE Finding Local Linear Correlations in High Dimensional Data

» Scalable Clustering for Large HighDimensional Data Based on Data Summarization

» Approximated Clustering of Distributed HighDimensional Data

» Pairwise Constrained Clustering for Sparse and High Dimensional Feature Spaces

» HighDimensional Feature Matching Employing the Concept of Meaningful Nearest Neighbors

» Identifying InformationRich Subspace Trends in HighDimensional Data

» REDUS finding reducible subspaces in high dimensional data

Post Info
More Details (n/a)

Added	30 May 2010
Updated	30 May 2010
Type	Conference
Year	2008
Where	ICPR
Authors	Takeshi Ueda, Kanji Tanaka

Comments (0)