UM  > 科技學院  > 電腦及資訊科學系
Practical constraint K-segment principal curve algorithms for generating railway GPS digital map
Chen D.1; Chen L.2
2013
Source PublicationMathematical Problems in Engineering
ISSN15635147 1024123X
Volume2013
Abstract

In order to obtain a decent trade-off between the low-cost, low-accuracy Global Positioning System (GPS) receivers and the requirements of high-precision digital maps for modern railways, using the concept of constraint K-segment principal curves (CKPCS) and the expert knowledge on railways, we propose three practical CKPCS generation algorithms with reduced computational complexity, and thereafter more suitable for engineering applications. The three algorithms are named ALLopt, MPMopt, and DCopt, in which ALLopt exploits global optimization and MPMopt and DCopt apply local optimization with different initial solutions. We compare the three practical algorithms according to their performance on average projection error, stability, and the fitness for simple and complex simulated trajectories with noise data. It is found that ALLopt only works well for simple curves and small data sets. The other two algorithms can work better for complex curves and large data sets. Moreover, MPMopt runs faster than DCopt, but DCopt can work better for some curves with cross points. The three algorithms are also applied in generating GPS digital maps for two railway GPS data sets measured in Qinghai-Tibet Railway (QTR). Similar results like the ones in synthetic data are obtained. Because the trajectory of a railway is relatively simple and straight, we conclude that MPMopt works best according to the comprehensive considerations on the speed of computation and the quality of generated CKPCS. MPMopt can be used to obtain some key points to represent a large amount of GPS data. Hence, it can greatly reduce the data storage requirements and increase the positioning speed for real-time digital map applications. © 2013 Dewang Chen and Long Chen.

DOI10.1155/2013/258694
URLView the original
Indexed BySCI
Language英语
WOS Research AreaEngineering ; Mathematics
WOS SubjectEngineering, Multidisciplinary ; Mathematics, Interdisciplinary Applications
WOS IDWOS:000329649900001
Fulltext Access
Citation statistics
Cited Times [WOS]:1   [WOS Record]     [Related Records in WOS]
Document TypeJournal article
CollectionDEPARTMENT OF COMPUTER AND INFORMATION SCIENCE
Affiliation1.Beijing Jiaotong University
2.Universidade de Macau
Recommended Citation
GB/T 7714
Chen D.,Chen L.. Practical constraint K-segment principal curve algorithms for generating railway GPS digital map[J]. Mathematical Problems in Engineering,2013,2013.
APA Chen D.,&Chen L..(2013).Practical constraint K-segment principal curve algorithms for generating railway GPS digital map.Mathematical Problems in Engineering,2013.
MLA Chen D.,et al."Practical constraint K-segment principal curve algorithms for generating railway GPS digital map".Mathematical Problems in Engineering 2013(2013).
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Chen D.]'s Articles
[Chen L.]'s Articles
Baidu academic
Similar articles in Baidu academic
[Chen D.]'s Articles
[Chen L.]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Chen D.]'s Articles
[Chen L.]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.