skip to main content
10.1145/1653771.1653819acmconferencesArticle/Chapter ViewAbstractPublication PagesgisConference Proceedingsconference-collections
research-article

Vehicle localization by matching triangulated point patterns

Published: 04 November 2009 Publication History

Abstract

We consider the problem of localizing a moving vehicle based on landmarks that were detected with a vehicle-mounted sensor. Landmarks are represented as points; correspondences of these points with the ones in a reference database are searched based on their geometric configurations. More specifically, we triangulate the landmark points and we match the obtained triangles with triangles in a reference database according to their geometric similarity. We maximize the number of triangle matches while considering the topological relations between different triangles, for example, if two triangles share an edge then the corresponding reference triangles must share an edge. Our method exploits that the observed points typically form a certain configuration: They appear at a limited distance from the vehicle's trajectory, thus the typical point pattern has a large extent in the driving direction and a relatively small lateral extent. This characteristic allows us to triangulate the observed point set such that we obtain a triangle strip (a sequence of triangles) in which each two consecutive triangles share one edge and each triangle connects three points that are relatively close to each other, that is, the triangle strip appropriately defines a neighborhood relationship for the landmarks. The adjacency graph of the triangles becomes a path; this allows for an efficient solution of our matching problem by dynamic programming. We present results of our method with data acquired with a mobile laser scanning system. The landmarks are objects of cylindric shape, for example, poles of traffic signs, which can be easily detected with the employed sensor. We tested the method with respect to its running time and its robustness when imposing different types of errors on the data. In particular, we tested the effect of non-rigid distortions of the observed point set, which are typically encountered during dead reckoning. Our matching approach copes well with such errors since it is based on local similarity measures of triangles, that is, we do not assume that a global non-rigid transformation between the observed point set and the reference point set exists.

References

[1]
G. Bebis, T. Deaconu, and M. Georgiopoulos. Fingerprint identification using Delaunay triangulation. In Proceedings of the 1999 International Conference on Information Intelligence and Systems (ICIIS), pages 452--459, 1999.
[2]
A. Bishnu, S. Das, S. C. Nandy, and B. B. Bhattacharya. Simple algorithms for partial point set pattern matching under rigid motion. Pattern Recognition, 39(9):1662--1671, 2006.
[3]
C. Brenner. Extraction of features from mobile laser scanning data for future driver assistance systems. In Advances in GIScience, Proceedings of the 12th AGILE Conference, pages 25--42, 2009.
[4]
M. Cho and D. M. Mount. Improved approximation bounds for planar point pattern matching. Algorithmica, 50(2): 175--207, 2008.
[5]
D. Conte, P. Foggia, C. Sansone, and M. Vento. Graph matching applications in pattern recognition and image processing. In Proceedings of the 10th International Conference on Image Processing (ICIP 2003), volume II, pages 21--24, 2003.
[6]
C. B. Cranston and H. Samet. Indexing point triples via triangle geometry. In Proceedings of the 23rd IEEE International Conference on Data Engineering, pages 936--945, 2007.
[7]
S. Dasgupta, C. H. Papadimitriou, and U. Vazirani. Algorithms. McGraw Hill Book Co, New York, 2006.
[8]
M. de Berg, O. Cheong, M. van Kreveld, and M. Overmars. Computational Geometry: Algorithms and Applications. Springer, Berlin, Germany, 2008.
[9]
M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, 1979.
[10]
O. Karch and T. Wahl. Relocalization -- theory and practice. Discrete Applied Mathematics, 93:89--108, 1999.
[11]
Z. M. Kovacs-Vajna. A fingerprint verification system based on triangular matching and dynamic time warping. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(11):1266--1276, 2000.
[12]
B. Li, Q. Meng, and H. Holstein. Point pattern matching and applications - a review. In Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, volume 1, pages 729--736, 2003.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
GIS '09: Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
November 2009
575 pages
ISBN:9781605586496
DOI:10.1145/1653771
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 November 2009

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. dynamic programming
  2. point pattern matching
  3. positioning

Qualifiers

  • Research-article

Conference

GIS '09
Sponsor:

Acceptance Rates

Overall Acceptance Rate 257 of 1,238 submissions, 21%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 28 Jan 2025

Other Metrics

Citations

Cited By

View all

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media