A Framework for Bus Trajectory Extraction and Missing Data Recovery for Data Sampled from the Internet

. 2017 Feb 10;17(2):342. doi: 10.3390/s17020342

Algorithm 4 Trajectory fragments connecting.

Input:

{\hat{G}}_{c}^{(m, l)}

n_{τ}

u_{\min}

;

Output:

S^{(m, l)}

;

Process:

(a1) get $U^{F}$ of ${\hat{G}}_{c}^{(m, l)}$ by Equation (17);
(a2) if $U^{F} = 0$ , go to (a4);
(a3) find $u_{i j}^{F} = u_{\max}^{F}$ ;
update ${\hat{G}}_{c}^{(m, l)}$ by setting ${\hat{G}}_{c}^{(i, m, l)} = {\hat{G}}^{(i \cup j)}$ ;
delete ${\hat{G}}_{c}^{(j, m, l)}$ ;
update $U^{F}$ by:
recalculating the i-th row of $U^{F}$ ;
removing both the j-th row and j-th column of $U^{F}$ ;
goto (a2);
(a4) set $S^{(m, l)} = {\hat{G}}_{c}^{(m, l)}$ .