Road Dataset Conflation via Locker Boundaries
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Maintaining up-to-date mapping data in geographic information systems (GIS) is challenging due to the difficulty in conflating bulk data, especially for complex geometries like road networks, where fully automated processes are inaccurate and manual processes are time-consuming and costly.
Innovation Solution
A computer-implemented method for conflating datasets by defining locker boundaries around base polylines, identifying matched and mismatched segments, and using a three-vertex approximation to align and match secondary polylines with base polylines, allowing for partial or full automation of the conflation process.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If fully automated data conflation is used, then processing speed is improved, but accuracy deteriorates
Solution Approach 1:
The patent segments the conflation process into distinct phases: initial automated matching using locker boundaries and three-vertex approximation, followed by refinement through segment splitting and gap filling. This segmentation allows automated processing to handle the bulk work while manual review focuses only on critical segments, resolving the contradiction between speed and accuracy.
Solution Approach 2:
The patent implements feedback mechanisms where the system automatically reviews and adjusts its own conflation decisions. By identifying segment splits and gaps, then using three-vertex approximation to correct offsets, the system continuously refines its accuracy based on previous automated decisions, enabling both speed and high accuracy.
2Measurement precision
If manual conflation process is used, then accuracy is improved, but time consumption increases
Solution Approach 1:
The patent applies partial automation where fully automated conflation is performed for the majority of segments, while manual intervention is reserved only for edge cases identified through segment splitting and gap analysis. This partial action approach achieves high accuracy for most data while minimizing manual time investment.
Solution Approach 2:
The system performs preliminary automated conflation using locker boundaries and three-vertex approximation before any manual review. This preliminary action handles the bulk processing efficiently, and only the most problematic segments requiring manual attention are identified and processed separately, significantly reducing overall time loss.
3Productivity
If automated conflation is applied to complex geometries, then processing efficiency is improved, but reliability deteriorates
Solution Approach 1:
The patent segments complex geometry conflation into manageable components by dividing polylines into segments based on locker boundaries. Each segment can be processed independently with automated methods, then stitched together, maintaining reliability through systematic processing of complex geometries.
Solution Approach 2:
The patent uses an intermediary three-vertex approximation method that acts as a mediator between the automated conflation process and the final reliable output. This intermediary calculation refines the automated matching by considering offset parameters, ensuring reliable conflation of complex geometries while maintaining processing efficiency.
Data Source
AI summary
In one aspect, a computer-implemented method for conflating a base dataset with a secondary dataset may generally include defining a locker boundary around each of a plurality of base polylines of the base dataset and identifying a plurality of initial matched segments and a plurality of initial mismatched segments for a plurality of secondary polylines of the secondary dataset, wherein each portion of the secondary polylines that is included within a locker boundary is defined as an initial matched segment and each portion of the secondary polylines that is not included within a locker boundary is defined as an initial mismatched segment. The method may also include identifying an offset parameter defined between a first initial matched segment and its corresponding base polyline using a three-vertex approximation and, if the offset parameter exceeds a predetermined offset threshold, defining the first initial matched segment as a mismatched segment.