Entropy based robust estimator and its application to line-based mapping
β Scribed by Yan Liu; Xinzheng Zhang; Ahmad B. Rad; Xuemei Ren; Yiu-Kwong Wong
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 842 KB
- Volume
- 58
- Category
- Article
- ISSN
- 0921-8890
No coin nor oath required. For personal study only.
β¦ Synopsis
This paper presents a robust mapping algorithm for an application in autonomous robots. The method is inspired by the notion of entropy from information theory. A kernel density estimator is adopted to estimate the appearance probability of samples directly from the data. An Entropy Based Robust (EBR) estimator is then designed that selects the most reliable inliers of the line segments. The inliers maintained by the entropy filter are those samples that carry more information. Hence, the parameters extracted from EBR estimator are accurate and robust to the outliers. The performance of the EBR estimator is illustrated by comparing the results with the performance of three other estimators via simulated and real data.
π SIMILAR VOLUMES
The routine modelling method for GM 1,1 grey model is described in details and its disadvantages are pointed out. The annealing evolution algorithm derived from simulated annealing and combined with the strategy of evolution in the genetic Ε½ . algorithm is applied to GM 1,1 modelling, and the unifor