Artificial intelligence augmentation of geographic data layers
A method for gap filling geographic information service data includes determining a bounding region at or near an initial alignment. The method also includes determining the initial alignment within the bounding region. A corridor buffer is generated at or near the initial alignment, and within the bounding region. Cost layer data is processed. Incompleteness of a number of polygon-bounded areas is determined based on the cost layer data. Partial completeness of the polygon-bounded areas and completeness of the polygon-bounded areas are also determined based on the cost layer data. A synthetic completeness of the number of polygon-bounded areas is generated based on the incompleteness, the partial completeness, synthetic completeness, and completeness of the polygon-based areas. A rasterized cost map including the completeness and the synthetic completeness of the polygon-bounded areas is stored at the processor(s) and in memory(ies).
1 . A method for gap filling of geographic information service (“GIS”) data, the method comprising:
determining, at at least one processor, a bounding region at or near an initial alignment;
determining, at the at least one processor, the initial alignment within the bounding region;
generating, at the at least one processor, a corridor buffer at or near the initial alignment and within the bounding region;
processing, at the at least one processor, cost layer data;
determining, at the at least one processor and based on the cost layer data, incompleteness of a plurality of polygon-bounded areas;
determining, at the at least one processor and based on the cost layer data, partial completeness of the plurality of polygon-bounded areas;
determining, at the at least one processor and based on the cost layer data, completeness of the plurality of polygon-bounded areas;
generating, at the at least one processor and based on the incompleteness, the partial completeness, synthetic completeness, and the completeness of the plurality of polygon-based areas, the synthetic completeness of the plurality of polygon-bounded areas; and
storing, at the at least one processor and in at least one memory, a rasterized cost map including the completeness and the synthetic completeness of the plurality of polygon-bounded areas.
2 . The method of claim 1 , in which the generating of the synthetic completeness is based on the completeness of the plurality of polygon-bounded areas, the synthetic completeness of the plurality of polygon-bounded areas, the partial completeness of the plurality of polygon-bounded areas, or a combination thereof.
3 . The method of claim 1 , further comprising communicating, at the at least one processor and from the at least one memory, the rasterized cost map to a one dimensional (1-D) optimizer, the 1-D optimizer being configured to optimize a profile of the initial alignment based on the completeness and synthetic completeness of the plurality of polygon-bounded areas.
4 . The method of claim 1 , in which the generating the corridor buffer is based on a point distribution.
5 . The method of claim 1 , in which the rasterized cost map comprises a two dimensional (2-D) plurality of values associated with costs to traverse.
6 . An apparatus for gap filling of geographic information service (“GIS”) data, the apparatus comprising:
at least one memory; and
at least one processor coupled to the at least one memory, the at least one processor configured:
to determine a bounding region at or near an initial alignment;
to determine the initial alignment within the bounding region;
to generate a corridor buffer at or near the initial alignment and within the bounding region;
to process cost layer data;
to determine based on the cost layer data, incompleteness of a plurality of polygon-bounded areas;
to determine, based on the cost layer data, partial completeness of the plurality of polygon-bounded areas;
to determine, based on the cost layer data, completeness of the plurality of polygon-bounded areas;
to generate, based on the incompleteness, the partial completeness, synthetic completeness, and the completeness of the plurality of polygon-based areas, the synthetic completeness of the plurality of polygon-bounded areas; and
to store in the at least one memory, a rasterized cost map, the rasterized cost map including the completeness and the synthetic completeness of the plurality of polygon-bounded areas.
7 . The apparatus of claim 6 , in which the at least one processor is further configured to generate the synthetic completeness based on the completeness of the plurality of polygon-bounded areas, the synthetic completeness of the plurality of polygon-bounded areas, the partial completeness of the plurality of polygon-bounded areas, or a combination thereof.
8 . The apparatus of claim 6 , in which the at least one processor is further configured to communicate, from the at least one memory, the rasterized cost map to a one dimensional (1-D) optimizer, the 1-D optimizer being configured to optimize a profile of the initial alignment based on the completeness and synthetic completeness of the plurality of polygon-bounded areas.
9 . The apparatus of claim 6 , in which the at least one processor is further configured to generate the corridor buffer is based on a point distribution.
10 . The apparatus of claim 6 , in which the rasterized cost map comprises a two dimensional (2-D) plurality of values associated with costs to traverse.
11 . A non-transitory computer-readable medium having program code recorded thereon, the program code executed by at least one processor and comprising:
program code to determine a bounding region, the bounding region being at or near an initial alignment;
program code to determine the initial alignment, the initial alignment being within the bounding region;
program code to generate a corridor buffer, the corridor buffer being at or near the initial alignment, the corridor buffer further being within the bounding region;
program code to process cost layer data;
program code to determine based on the cost layer data, incompleteness of a plurality of polygon-bounded areas;
program code to determine based on the cost layer data, partial completeness of the plurality of polygon-bounded areas;
program code to determine based on the cost layer data, completeness of the plurality of polygon-bounded areas;
program code to generate based on the incompleteness, the partial completeness, synthetic completeness, and the completeness of the plurality of polygon-based areas, the synthetic completeness of the plurality of polygon-bounded areas; and
program code to store, at the at least one processor and in at least one memory, a rasterized cost map, the rasterized cost map including the completeness and the synthetic completeness of the plurality of polygon-bounded areas.
12 . The non-transitory computer-readable medium of claim 11 , in which the program code comprises program code to generate the synthetic completeness based on the completeness of the plurality of polygon-bounded areas, the synthetic completeness of the plurality of polygon-bounded areas, the partial completeness of the plurality of polygon-bounded areas, or a combination thereof.
13 . The non-transitory computer-readable medium of claim 11 , in which the program code comprises program code to communicate, at the at least one processor and from the at least one memory, the rasterized cost map to a 1-D optimizer, the 1-D optimizer being configured to optimize a profile of the initial alignment based on the completeness and synthetic completeness of the plurality of polygon-bounded areas.
14 . The non-transitory computer-readable medium of claim 11 , in which the program code to generate the corridor buffer is based on a point distribution.
15 . The non-transitory computer-readable medium of claim 11 , in which the rasterized cost map comprises a two dimensional (2-D) plurality of values associated with costs to traverse.
16 . An apparatus for gap filling of geographic information service (“GIS”) data, comprising:
means for determining, at at least one processor, a bounding region at or near an initial alignment;
means for determining, at the at least one processor, the initial alignment within the bounding region;
means for generating, at the at least one processor, a corridor buffer at or near the initial alignment and within the bounding region;
means for processing, at the at least one processor, cost layer data;
means for determining, at the at least one processor and based on the cost layer data, incompleteness of a plurality of polygon-bounded areas;
means for determining, at the at least one processor and based on the cost layer data, partial completeness of the plurality of polygon-bounded areas;
means for determining, at the at least one processor and based on the cost layer data, completeness of the plurality of polygon-bounded areas;
means for generating, at the at least one processor and based on the incompleteness, the partial completeness, synthetic completeness, and the completeness of the plurality of polygon-based areas, the synthetic completeness of the plurality of polygon-bounded areas; and
means for storing, at the at least one processor and in at least one memory, a rasterized cost map, the rasterized cost map including the completeness and the synthetic completeness of the plurality of polygon-bounded areas.
17 . The apparatus of claim 16 , further comprising means for generating the synthetic completeness, at the at least one processor, based on the completeness of the plurality of polygon-bounded areas, the synthetic completeness of the plurality of polygon-bounded areas, the partial completeness of the plurality of polygon-bounded areas, or a combination thereof.
18 . The apparatus of claim 16 , further comprising means for communicating, at the at least one processor and from the at least one memory, the rasterized cost map to a one dimensional (1-D) optimizer, the 1-D optimizer being configured to optimize a profile of the initial alignment based on the completeness and synthetic completeness of the plurality of polygon-bounded areas.
19 . The apparatus of claim 16 , in which the means for generating the corridor buffer is based on a point distribution.
20 . The apparatus of claim 16 , in which the rasterized cost map comprises a two dimensional (2-D) plurality of values associated with costs to traverse.