Map-matching in complex urban road networks
Citations
1,289 citations
Cites background or methods from "Map-matching in complex urban road ..."
...According to the additional information used, map matching algorithms can be categorized into four groups: geometric [36], topological [22][118], probabilistic [75] [83] [86] and other advanced techniques [63][73][126]....
[...]
...To deal with noisy and low-sampling rate trajectories, probabilistic algorithms [Ochieng et al. 2004; Pink and Hummel 2008; Quddus et al. 2006] make explicit provisions for GPS noise and consider multiple possible paths through the road network to find the best one....
[...]
...…algorithms can be categorized into four groups: geometric [Greenfeld 2002], topological [Chen et al. 2003; Yin and Wolfson 2004], probabilistic [Ochieng et al. 2004; Pink and Hummel 2008; Quddus et al. 2006], and other advanced techniques [Lou et al. 2009; Newson and Krumm 2009; Yuan et al.…...
[...]
...To deal with noisy and lowsampling rate trajectories, probabilistic algorithms [75][83][86] make explicit provisions for GPS noise and consider multiple possible paths through the road network to find the best one....
[...]
799 citations
Cites background from "Map-matching in complex urban road ..."
...Ochieng et al. (2004) developed an enhanced probabilistic map-matching algorithm....
[...]
...…algorithms in the literature can be categorised into four groups: geometric (Bernstein and Kornhauser, 1996), topological (White et al., 2000; Joshi, 2001; Greenfeld, 2002; Chen et al., 2003; Quddus et al., 2003), probabilistic (Zhao, 1997; Ochieng et al., 2004), and other advanced…...
[...]
...This suggests that research should be directed at identifying any constraints and limitations of existing map matching algorithms as a prerequisite for the formulation of algorithm improvements....
[...]
...Map-matching not only enables the physical location of the vehicle to be identified but also improves the positioning accuracy if good spatial road network data are available (Ochieng et al., 2004)....
[...]
...…1996), topological (White et al., 2000; Joshi, 2001; Greenfeld, 2002; Chen et al., 2003; Quddus et al., 2003), probabilistic (Zhao, 1997; Ochieng et al., 2004), and other advanced techniques (El Najjar and Bonnifait, 2005; Pyo et al., 2001; Yang et al., 2003; Jagadeesh et al., 2004;…...
[...]
381 citations
Cites background or methods from "Map-matching in complex urban road ..."
...obabilistic graphical model in which the path variables pt are unobserved. Depending on the specifics of the transition models, ˇ^ ( xjp )and , probabilistic inference has been done with Kalman filters [28], [29], the forward algorithm or the Viterbi algorithm [4], [5], or particle filters [17]. Hidden Markov Model representations, however, suffer from the selection bias problem, first noted in the labeli...
[...]
...undred meters, with very few intersections). In this context, there is usually a dominant path that starts from a well-defined point, and Bayesian filters accurately reconstruct paths from observations [28], [38], [17]. When sampling rates are lower and observed points are further apart, however, a large number of paths are possible between two points. Researchers have recently focused on efficiently ide...
[...]
...rithms cannot readily cope with ambiguous observations [24], and were soon expanded into probabilistic frameworks. A number of implementations were explored: particle filters [29], [17], Kalman filters [28], Hidden Markov Models [4], and less mainstream approaches based on Fuzzy Logic and Belief Theory. Two types of information are missing in a sequence of GPS readings: the exact location of the vehicle...
[...]
315 citations
Cites methods from "Map-matching in complex urban road ..."
...According to the information of input GPS tracking data used, existing methods can be categorized into four groups: geometric [12], topological [13, 14], probabilistic [15] and other advanced techniques [16, 17, 19]....
[...]
...A probabilistic map matching algorithm is developed in [15]....
[...]
243 citations
References
6,015 citations
1,524 citations
"Map-matching in complex urban road ..." refers background in this paper
...Since there is no more information available about the estimate of e , according to Gelb (1979) the optimal estimate is simply the linear function of the measurements in the form e...
[...]
...Since there is no more information available about the estimate of e , according to Gelb (1979) the optimal estimate is simply the linear function of the measurements in the form e 2ω 1 ρσ 2ω 2121 )( σωω =E 1 ρ 1 2 2211ˆ ekeke += (8) where and still need to be specified and are independent of e ....
[...]
861 citations
"Map-matching in complex urban road ..." refers background in this paper
...A number of data structures and algorithms exist to identify the closest node (or shape point) from a given point in a network (e.g., Bentley and Maurer, 1980; Fuchs et al., 1980)....
[...]
647 citations
"Map-matching in complex urban road ..." refers background in this paper
...This is also known as curve-to-curve matching (Bernstein and Kornhauser, 1996; White et al., 2000)....
[...]
...Another geometric MM approach is point-tocurve matching (e.g., Bernstein and Kornhauser, 1996; White et al., 2000; Taylor et al. 2001)....
[...]
494 citations
"Map-matching in complex urban road ..." refers background or result in this paper
...2 Note that digital spatial data specifically for transportation applications are beginning to emerge Id T is to identify the actual link among the candidate links (Greenfeld, 2002; Quddus et al. 2003)....
[...]
...However, Greenfeld (2002) described that the orthogonal projection of the position fixes on the arc are different from the actual location of the vehicle on the arc....
[...]
...Greenfeld (2002) reviews several approaches for solving the map matching problem and proposes a weighted topological algorithm....
[...]
...Greenfeld (2002) also suggests that additional research is required to verify the accurate performance of the algorithm and to make an accurate position determination on a given road segment....
[...]
...This approach is quite sensitive to outliers and depends on point-to-point matching, sometimes giving unexpected results (Greenfeld 2002)....
[...]