Intelligent Localization of a High-Speed Train Using LSSVM and the Online Sparse Optimization Approach
Authors:
- 9 March 2017
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 18 (8) , 2071-2084
Abstract
For a high-speed train (HST), quick and accurate localization of its position is crucial to safe and effective operation of the HST. In this paper, we develop a mathematical localization model by analyzing the location report created by the HST. Then, we apply two sparse optimization algorithms, i.e., iterative pruning error minimization (IPEM) and L 0 -norm minimization algorithms, to improve the sparsity of both least squares support vector machine (LSSVM) and weighted LSSVM models. Furthermore, in order to enhance the adaptability and real-time performance of established localization model, four online sparse learning algorithms LSSVM-online, IPEM-online, L 0 -norm-online, and hybrid-online are developed to sparsify the training data set and update parameters of the LSSVM model online. Finally, the field data of the Beijing-Shanghai highspeed railway (BS_HSR) is used to test the performance of the established localization models. The proposed method overcomes the problem of memory constraints and high computational costs resulting in highly sparse reductions to the LSSVM models. Experiments on real-world data sets from the BS_HSR illustrate that these methods achieve sparse models and increase the realtime performance in online updating process on the premise of reducing the location error. For the rapid convergence of proposed online sparse algorithms, the localization model can be updated when the HST passes through the balise every time.Keywords
Funding Information
- National Science Foundation of China (61103153/F020503)
- Start Project for Minjiang Chair Professor by Fujian Province (510146)
- Project from the Fujian Province Key Laboratory of Network Computing and Intelligent Information Processing (2009J1007)
This publication has 29 references indexed in Scilit:
- Online Least Squares One-Class Support Vector Machines-Based Abnormal Visual Event DetectionSensors, 2013
- An integrated error-detecting method based on expert knowledge for GPS data points measured in Qinghai–Tibet RailwayExpert Systems with Applications, 2012
- Sparse learning for support vector classificationPattern Recognition Letters, 2010
- Weighted least squares support vector machine local region method for nonlinear time series predictionApplied Soft Computing, 2009
- A method to sparsify the solution of support vector regressionNeural Computing and Applications, 2009
- Text classification: A least square support vector machine approachApplied Soft Computing, 2007
- SMO-Based Pruning Methods for Sparse Least Squares Support Vector MachinesIEEE Transactions on Neural Networks, 2005
- Pruning error minimization in least squares support vector machinesIEEE Transactions on Neural Networks, 2003
- Weighted least squares support vector machines: robustness and sparse approximationNeurocomputing, 2002
- Pruning algorithms-a surveyIEEE Transactions on Neural Networks, 1993