Abstract: A navigation system, method, apparatus and computer program product process probe data utilizing map-centric map matching. In a method, the grid cell in which the probe point is located is determined from among a plurality of grid cells of a region. The method also projects the probe point onto a road center polyline segment associated with the grid cell. The road center polyline segment extends through a map matching road region having edges that are spaced apart from a road center of a road segment by a predefined distance such that a probe point inside a grid cell that is intersected by or included by the map matching region associates the probe point with the road center polyline segment and thereby with road segment as well. Traffic estimation and route guidance may be provided based upon the association of the probe point with the road segment.

Abstract: A method, apparatus and computer program product are provided to process probe data in accordance with a map-centric map matching technique. In the context of a method, a plurality of vertices are defined along a polyline representative of a road segment such that the polyline includes one or more edges. Each edge extends between a pair of neighboring vertices. For each vertex of a respective edge, spatial searches are conducted to identify each probe point within a region about a respective vertex. For each probe point identified within a region about a respective vertex, a determination is made as to whether the probe point satisfies a projection criteria in order for the probe point to be projected onto the edge or one of the neighboring vertices between which the edge extends.

Abstract: Provided herein is a method for establishing lane-level data from probe data. Methods may include receiving probe data points associated with a plurality of vehicles; determining, for each of the probe data points, a location and road segment corresponding to the location; generating, from the probe data points associated with a first road segment, a cell-density image of the first road segment, where the cell-density image represents a volume of probe data points at each of a plurality of cells of a grid overlaid on the first road segment; applying a deconvolution method to the cell-density image to obtain a refined cell-density image having a lower degree of data point spread; determining, from the refined cell-density image, a number of paths along the first road segment, where each path represents a lane; and computing, from the refined cell-density image, lane-level properties of the probe data of the first road segment.

Abstract: A method, apparatus and computer program product are provided to define bi-directional road geometry based upon a plurality of probe points. An orientation representative of one or more probe points is determined and a seed point representative of one or more probe points is then determined. The seed point is based on a determination of a constrained weighted center of mass of the one or more probe points. The movement of the constrained weighted center of mass is limited to a direction based upon respective headings of the one or more probe points. Polylines are created to be representative of a bi-directional road geometry. The polylines are created to be representative of one direction of travel along the bi-directional road geometry by extending a first polyline in the orientation from the seed point and by extending a second polyline in an opposite orientation from the seed point.

Abstract: Road geometries may be determined from sparse data by identifying a set of mobile device data points generated by a mobile device located in a geographic area. Further, the data points may be connected with a curve comprising a series of splines defined by curve functions. The shape of the splines may be optimized by applying a scaling factor to the curve functions. A resulting optimized curve may be representative of a road in a geographic area.

Abstract: Provided herein is a method for establishing lane-level data from probe data. Methods may include receiving probe data points associated with a plurality of vehicles; determining, for each of the probe data points, a location and road segment corresponding to the location; generating, from the probe data points associated with a first road segment, a probe density histogram for the first road segment, where the probe density histogram represents a volume of probe data points at each of a plurality of positions across a width of the first road segment; applying a deconvolution method to the probe density histogram to obtain a multi-modal histogram; determining, from the multi-modal histogram, a number of statistically significant peaks, where each statistically significant peak represents a lane of the first road segment; and computing, from the multi-modal histogram, lane-level properties of the probe data of the first road segment.

Abstract: Provided herein is a method for establishing lane-level data from probe data. Methods may include receiving probe data points associated with a plurality of vehicles; determining, for each of the probe data points, a location and road segment corresponding to the location; generating, from the probe data points associated with a first road segment, a probe density histogram for the first road segment, where the probe density histogram represents a volume of probe data points at each of a plurality of positions across a width of the first road segment; applying a deconvolution method to the probe density histogram to obtain a multi-modal histogram; determining, from the multi-modal histogram, a number of statistically significant peaks, where each statistically significant peak represents a lane of the first road segment; and computing, from the multi-modal histogram, lane-level properties of the probe data of the first road segment.

Abstract: Provided herein is a method for establishing lane-level data from probe data. Methods may include receiving probe data points associated with a plurality of vehicles; determining, for each of the probe data points, a location and road segment corresponding to the location; generating, from the probe data points associated with a first road segment, a cell-density image of the first road segment, where the cell-density image represents a volume of probe data points at each of a plurality of cells of a grid overlaid on the first road segment; applying a deconvolution method to the cell-density image to obtain a refined cell-density image having a lower degree of data point spread; determining, from the refined cell-density image, a number of paths along the first road segment, where each path represents a lane; and computing, from the refined cell-density image, lane-level properties of the probe data of the first road segment.

Abstract: A method, apparatus and computer program product are provided in order to define the road geometry based upon a plurality of probe points. In the context of a method, a seed point is determined that is representative of one or more probe points. The method determines the seed point by determining a weighted center of mass of the one or more probe points. The method also includes determining an orientation representative of one or more probe points proximate the seed point and creating a polyline representative of the road geometry. In this regard, the method creates the polyline by extending the polyline in the orientation from the seed point.

Abstract: A method, apparatus, and computer program product are provided for determining whether probe data points are map-matched or non-map-matched such that the probe data can be processed and analyzed appropriately without introducing bias into the analysis which may be caused by map-matching ahead of analysis. A mapping system includes a memory having map data stored therein, and processing circuitry. The processing circuitry may be configured to receive probe data points associated with a plurality of vehicles. Each probe data point is received from a probe apparatus of a plurality of probe apparatuses. The probe apparatus includes a plurality of sensors and being onboard a respective vehicle. Each probe data point includes location information associated with the respective probe apparatus.

Abstract: A method, apparatus and computer program product are provided to process probe data in accordance with a map-centric map matching technique. In the context of a method, a plurality of vertices are defined along a polyline representative of a road segment such that the polyline includes one or more edges. Each edge extends between a pair of neighboring vertices. For each vertex of a respective edge, spatial searches are conducted to identify each probe point within a region about a respective vertex. For each probe point identified within a region about a respective vertex, a determination is made as to whether the probe point satisfies a projection criteria in order for the probe point to be projected onto the edge or one of the neighboring vertices between which the edge extends.

Abstract: A method, apparatus and computer program product utilize virtual probe points, such as in combination with traditional probe points, for various routing and navigation purposes. In the context of a method, virtual probe data is received from a plurality of sources. The virtual probe data includes a plurality of virtual probe points at different respective locations. For a virtual probe point, the virtual probe data includes a hashed identifier of a vehicle and a location of the vehicle. The hashed identifiers of the virtual probe data that is received have been subjected to the same hash function by each of the plurality of sources. The method also includes updating a probe data repository with the virtual probe data including the plurality of virtual probe points and the hashed identifiers associated therewith.

Abstract: A method, apparatus and computer program product are provided to determine the stacking order of two or more roads that are vertically aligned with one another. In the context of a method, error statistics associated with probe points representative of travel along a first road are determined. In an instance in which the first road is vertically aligned with a second road, the method also includes determining whether one of the first or second roads passes beneath the other of the first or second roads based at least in part upon the error statistics associated with the probe points representative of travel along the first road. A corresponding apparatus and computer program product are also provided.

Abstract: A method, apparatus and computer program product are provided to disambiguate probe points within an ambiguous probe regions to permit more reliable association with a road segment. In regards to a method, probe trajectory identifiers (IDs) of probe points along at least a portion of the first and second branches that lead away from an ambiguous probe region are separately identified and form first and second sets of probe trajectory IDs, respectively. For the ambiguous probe region, the probe trajectory IDs of probe points along a third branch that leads toward the ambiguous probe region are identified and form a third set of probe trajectory IDs. The method also includes classifying probe trajectory IDs from the third set as being associated with the first branch or the second branch in an instance in which the probe trajectory IDs are additionally included in the first set or the second set, respectively.

Abstract: A method, apparatus and computer program product are provided to process probe data in accordance with a map-centric map matching technique. In the context of a method, a plurality of vertices are defined along a polyline representative of a road segment such that the polyline includes one or more edges. Each edge extends between a pair of neighboring vertices. For each vertex of a respective edge, spatial searches are conducted to identify each probe point within a region about a respective vertex. For each probe point identified within a region about a respective vertex, a determination is made as to whether the probe point satisfies a projection criteria in order for the probe point to be projected onto the edge or one of the neighboring vertices between which the edge extends.

Abstract: A method, apparatus and computer program product are provided to disambiguate probe points within an ambiguous probe regions to permit more reliable association with a road segment. In regards to a method, probe trajectory identifiers (IDs) of probe points along at least a portion of the first and second branches that lead away from an ambiguous probe region are separately identified and form first and second sets of probe trajectory IDs, respectively. For the ambiguous probe region, the probe trajectory IDs of probe points along a third branch that leads toward the ambiguous probe region are identified and form a third set of probe trajectory IDs. The method also includes classifying probe trajectory IDs from the third set as being associated with the first branch or the second branch in an instance in which the probe trajectory IDs are additionally included in the first set or the second set, respectively.

Abstract: A method, apparatus and computer program product are provided for generating map geometry based on a received image and probe data. A method is provided including receiving a first image and probe data associated with the first image, categorizing pixels of the first image based on the probe data, and generating a map geometry based on the pixel categorization of the first image.

Abstract: A method, apparatus and computer program product are provided to match probe points to road segments utilizing a trajectory identifier, thereby increasing the accuracy with which probe points, such as probe points in ambiguous locations, are matched to road segments. For a probe point having a respective trajectory identifier (ID) and associated with an ambiguous link tuple, the method identifies each probe point having the respective trajectory ID that is unambiguously matched to first or second branches. The method separately determines a number of probe points having the respective trajectory ID that are unambiguously matched to the first and second branches. The method matches the probe point having the respective trajectory ID and associated with the ambiguous link tuple to either the first branch or the second branch based upon the number of probe points having the respective trajectory ID that are unambiguously matched to the first and second branches.

Abstract: In one embodiment, navigational features of a navigation device are activated or deactivated according to the accuracy of the geographic data. The navigation features may be predictive features related to upcoming portions of a path curve. The path curve is compared to measured data. For example, a first curve is accessed from a map database and a second curve is based on measured position data collected while traversing the path. The first curve and the second curve correspond to the same geographic area. A difference of an attribute between a section of the first curve and a section of the second curve is used to assign a confidence factor to the section of the first polycurve based on the difference. The attribute may be heading, position, curvature, or another aspect of the path curves.

Abstract: A mapping system, method and computer program product are provided to identify a parking lot from probe data. In the context of a mapping system, processing circuitry is configured to determine a parking likelihood for each grid cell based upon probe data points associated with the respective grid cells and to identify likely parking locations in instances in which the parking likelihood for a respective grid cell satisfies a predefined threshold. The processing circuitry is also configured to cluster likely parking locations to identify parking lot clusters and to determine the boundary of the parking lot pursuant to a deformable contour model which causes a polygon to expand from a respective parking lot cluster so as to represent the boundary of the parking lot. The processing circuitry is further configured to update a map to include the parking lot having the boundary determined pursuant to the deformable contour model.