Name
Abstract | ||
|---|---|---|
Traffic signal phase and timing (TSPaT) information is valuable for various applications, such as velocity advisory systems, navigation systems, collision warning systems, and so forth. In this paper, we focus on learning baseline timing cycle lengths for fixed-time traffic signals. The cycle length is the most important parameter among all timing parameters, such as green lengths. We formulate the cycle length learning problem as a period estimation problem using a sparse set of noisy observations, and propose the most frequent approximate greatest common divisor (MFAGCD) algorithms to solve the problem. The accuracy performance of our proposed algorithms is experimentally evaluated on both simulation data and the real taxi GPS trajectory data collected in Shanghai, China. Experimental results show that the MFAGCD algorithms have better sparsity and outliers tolerant capabilities than existing cycle length estimation algorithms. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1587/transinf.2016IIP0022 | IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS |
Keywords | Field | DocType |
taxi GPS trajectory, traffic signals, cycle length estimation | Computer vision,Traffic signal,Computer science,Artificial intelligence,Global Positioning System | Journal |
Volume | Issue | ISSN |
E101D | 4 | 1745-1361 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Juan Yu | 1 | 8 | 3.15 |
| Peizhong Lu | 2 | 230 | 22.46 |
| Jianmin Han | 3 | 25 | 5.74 |
| Jianfeng Lu | 4 | 26 | 7.61 |