2005
DOI: 10.1109/tro.2004.835452
|View full text |Cite
|
Sign up to set email alerts
|

Vision-based localization algorithm based on landmark matching, triangulation, reconstruction, and comparison

Abstract: Abstract-Many generic position-estimation algorithms are vulnerable to ambiguity introduced by nonunique landmarks. Also, the available high-dimensional image data is not fully used when these techniques are extended to vision-based localization. This paper presents the landmark matching, triangulation, reconstruction, and comparison (LTRC) global localization algorithm, which is reasonably immune to ambiguous landmark matches. It extracts natural landmarks for the (rough) matching stage before generating the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
34
0

Year Published

2006
2006
2022
2022

Publication Types

Select...
6
2
2

Relationship

0
10

Authors

Journals

citations
Cited by 68 publications
(34 citation statements)
references
References 18 publications
0
34
0
Order By: Relevance
“…1 is fed into RANSAC along with the set of generated putatives C t , where a set of promising inlier putatives are selected to produce an optimal camera pose θ t . The RANSAC-based framework described above is very popular and has been used successfully by many authors [14], [15]. As the map M becomes larger and denser, we need to pay special attention in step (c) in order to maintain high-quality putative matches, since the high ratio of outlier putative matches will cause the RANSAC procedure in step (d) to slow down substantially or even fail to compute a correct estimate [16], which will result in under-performing system.…”
Section: Vision-based Camera Localizationmentioning
confidence: 99%
“…1 is fed into RANSAC along with the set of generated putatives C t , where a set of promising inlier putatives are selected to produce an optimal camera pose θ t . The RANSAC-based framework described above is very popular and has been used successfully by many authors [14], [15]. As the map M becomes larger and denser, we need to pay special attention in step (c) in order to maintain high-quality putative matches, since the high ratio of outlier putative matches will cause the RANSAC procedure in step (d) to slow down substantially or even fail to compute a correct estimate [16], which will result in under-performing system.…”
Section: Vision-based Camera Localizationmentioning
confidence: 99%
“…To achieve this goal, vision based approaches have been tried, which help a robot to acquire meaningful information from visual images [6,7]. However, they require high computing cost and built-in sensors in robot.…”
Section: Related Workmentioning
confidence: 99%
“…The RANSAC algorithm [19] is a useful method to estimate parameters of such models, however for efficiency, an agglomerative hierarchical tree T is used to identify the clusters. To construct the tree, Ψ (k) is heat mapped, represented as a symmetric matrix M , with respect to Manhattan distance between each individual helix,…”
Section: Helix Bearing Algorithmmentioning
confidence: 99%