Fan Hu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Fan Hu has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Chuanming Chen
Anhui Normal University
2 shared publications - Qingying Yu
School of Computer and Information, Anhui Normal University, Wuhu, China
2 shared publications - Chul Ahn
Department of Population and Data Sciences, University of Texas Southwestern Medical Center, Dallas, Texas
1 shared publication - Haokun Wu
College of Electrical and Information Engineering Hunan University Changsha 410082 People's Republic of China
1 shared publication Keyuan Huang
College of Electrical & information Engineering, Hunan University, Changsha, China
1 shared publicationLiping Sun
School of Computer and Information, Anhui Normal University, Wuhu, China
1 shared publication
Latest Publications
- Open Access
- 23 June 2022
- Published by MDPI AG in ISPRS International Journal of Geo-Information
- Vol. 11 (7) , 355
Low-Frequency Trajectory Map Matching Method Based on Vehicle Heading Segmentation
Numerous Global Positioning System connected vehicles are collecting extensive data remotely in cities, enabling data-driven infrastructure planning. To truly benefit from this emerging technology, it is important to combine telematics and map data to make it easier to extract and mine useful information from the data. By performing map matching, data points that cannot be accurately located on the road network can be projected onto the correct road segment. As an important means of remote data processing, it has become an important pre-processing step in the field of data mining. However, due to the various errors of location devices and the complexity of road networks, map matching technology also faces great challenges. In order to improve the efficiency and accuracy of the map matching algorithm, this study proposes an offline method for low-frequency trajectory data map matching based on vehicle trajectory segmentation. First, the trajectory is segmented based on the vehicle’s travel direction. Then, the comprehensive probability of the corresponding road segment is calculated based on the spatial probability and the directional probability of each road segment around the location. Third, the k candidate matching paths under consideration are selected based on the comprehensive probability evaluation. Finally, the shortest path planning and the probability calculation of the different candidate paths are combined to find the optimal matching path. The experimental results on the real trajectory dataset in Shanghai and the road network environment show that the proposed algorithm has better accuracy, efficiency, and robustness than other algorithms.
- 23 June 2022
- Published by MDPI AG in ISPRS International Journal of Geo-Information
- Vol. 11 (7) , 355
Open AccessLow-Frequency Trajectory Map Matching Method Based on Vehicle Heading Segmentation
Numerous Global Positioning System connected vehicles are collecting extensive data remotely in cities, enabling data-driven infrastructure planning. To truly benefit from this emerging technology, it is important to combine telematics and map data to make it easier to extract and mine useful information from the data. By performing map matching, data points that cannot be accurately located on the road network can be projected onto the correct road segment. As an important means of remote data processing, it has become an important pre-processing step in the field of data mining. However, due to the various errors of location devices and the complexity of road networks, map matching technology also faces great challenges. In order to improve the efficiency and accuracy of the map matching algorithm, this study proposes an offline method for low-frequency trajectory data map matching based on vehicle trajectory segmentation. First, the trajectory is segmented based on the vehicle’s travel direction. Then, the comprehensive probability of the corresponding road segment is calculated based on the spatial probability and the directional probability of each road segment around the location. Third, the k candidate matching paths under consideration are selected based on the comprehensive probability evaluation. Finally, the shortest path planning and the probability calculation of the different candidate paths are combined to find the optimal matching path. The experimental results on the real trajectory dataset in Shanghai and the road network environment show that the proposed algorithm has better accuracy, efficiency, and robustness than other algorithms.
- 8 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 23 (10) , 17530-17545
High-Frequency Trajectory Map Matching Algorithm Based on Road Network Topology
Accurately mapping the raw global position system (GPS) trajectories to the road network is the basis for studying the application of trajectory data. This study proposes a novel off-line map matching algorithm based on road network topology, to address the problems of low execution efficiency and poor matching accuracy of selective look-ahead map matching (SLAMM) algorithm. First, the noise points of the trajectory data are removed by data preprocessing. Second, the algorithm searches for critical samples in the trajectory data and segments the data accordingly. Then, the adjacent road segments around the transition node corresponding to the critical sample are selected as candidate arcs. Finally, the segmented trajectory data are matched to the road network by constructing an error ellipse. The algorithm fully considers the topology of the road network and the characteristics of high-frequency trajectory data. The experimental results, using Beijing trajectory data to perform matching on an actual road network environment, show that the proposed algorithm is more efficient and robust than other map matching algorithms for high-frequency trajectories.
- 8 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 23 (10) , 17530-17545
High-Frequency Trajectory Map Matching Algorithm Based on Road Network Topology
Accurately mapping the raw global position system (GPS) trajectories to the road network is the basis for studying the application of trajectory data. This study proposes a novel off-line map matching algorithm based on road network topology, to address the problems of low execution efficiency and poor matching accuracy of selective look-ahead map matching (SLAMM) algorithm. First, the noise points of the trajectory data are removed by data preprocessing. Second, the algorithm searches for critical samples in the trajectory data and segments the data accordingly. Then, the adjacent road segments around the transition node corresponding to the critical sample are selected as candidate arcs. Finally, the segmented trajectory data are matched to the road network by constructing an error ellipse. The algorithm fully considers the topology of the road network and the characteristics of high-frequency trajectory data. The experimental results, using Beijing trajectory data to perform matching on an actual road network environment, show that the proposed algorithm is more efficient and robust than other map matching algorithms for high-frequency trajectories.
- Open Access
- 1 February 2011
- Published by Taylor & Francis in Statistics in Biopharmaceutical Research
- Vol. 3 (1) , 65-72
Sample Size Calculation for Clustered Binary Data with Sign Tests Using Different Weighting Schemes
We propose a sample size calculation approach for testing a proportion using the weighted sign test when binary observations are dependent within a cluster. Sample size formulas are derived with nonparametric methods using three weighting schemes: equal weights to observations, equal weights to clusters, and optimal weights that minimize the variance of the estimator. Sample size formulas are derived incorporating intracluster correlation and the variability in cluster sizes. Simulation studies are conducted to evaluate a finite sample performance of the proposed sample size formulas. Empirical powers are generally close to nominal levels. The number of clusters required increases as the imbalance in cluster size increases and the intracluster correlation increases. The estimator using optimal weights yields the smallest sample size estimate among three estimators. For small values of intracluster correlation the sample size estimates derived from the optimal weight estimator are close to that derived from the estimator assigning equal weights to observations. For large values of intracluster correlation, the optimal weight sample size estimate is close to the sample size estimate assigning equal weights to clusters.
- 1 February 2011
- Published by Taylor & Francis in Statistics in Biopharmaceutical Research
- Vol. 3 (1) , 65-72
Open AccessSample Size Calculation for Clustered Binary Data with Sign Tests Using Different Weighting Schemes
We propose a sample size calculation approach for testing a proportion using the weighted sign test when binary observations are dependent within a cluster. Sample size formulas are derived with nonparametric methods using three weighting schemes: equal weights to observations, equal weights to clusters, and optimal weights that minimize the variance of the estimator. Sample size formulas are derived incorporating intracluster correlation and the variability in cluster sizes. Simulation studies are conducted to evaluate a finite sample performance of the proposed sample size formulas. Empirical powers are generally close to nominal levels. The number of clusters required increases as the imbalance in cluster size increases and the intracluster correlation increases. The estimator using optimal weights yields the smallest sample size estimate among three estimators. For small values of intracluster correlation the sample size estimates derived from the optimal weight estimator are close to that derived from the estimator assigning equal weights to observations. For large values of intracluster correlation, the optimal weight sample size estimate is close to the sample size estimate assigning equal weights to clusters.