Geocoding Point Addresses to Street Centerlines
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current geocoding systems face challenges in accurately assigning point level address geocodes to street networks, particularly in routing and dispatch applications, due to the inability to accurately tie point geocodes to their parent street segments, leading to ambiguous routing and potential errors.
Innovation Solution
A method that dynamically identifies the appropriate street centerline for point level address geocodes by comparing address elements from point data records with segment data records, calculating the bearing and distance to the centerline, and handling heterogeneous datasets, allowing for real-time accurate geocode assignment.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If point level geocodes are used to locate properties exactly, then positioning accuracy is improved, but the ability to tie point geocodes to parent street segments deteriorates
Solution Approach 1:
The patent introduces an intermediary process that compares address elements from point data records with segment data records to identify the parent street segment. This intermediary matching process resolves the contradiction by providing a bridge between the accurate point geocode and the street network, allowing both precise positioning and reliable street segment identification.
Solution Approach 2:
The patent segments the address matching process into multiple components: collecting candidate point data records, comparing address elements, identifying matching segment data records, and calculating bearing and distance. This segmentation allows the system to handle the complex task of tying point geocodes to street segments systematically, resolving the reliability issue while maintaining positioning accuracy.
2Ease of operation
If interpolation is used to relate centerline to specific address, then street centerline geocode can be obtained, but accuracy may not match ground truth represented by point level data
Solution Approach 1:
The patent employs a dynamic approach where the system determines whether point data exists for the input address and adapts its methodology accordingly. When point data is available, it uses the accurate point geocode and calculates the relationship to the street centerline dynamically, rather than relying solely on static interpolation methods. This dynamic adaptation ensures both ease of operation and high accuracy.
Solution Approach 2:
The patent changes the approach based on data availability - switching between interpolation methods and point-data-based methods. By parameterizing the geocoding process to select different methodologies based on the presence and quality of data, the system achieves both operational simplicity and measurement precision.
3Productivity
If geographic search is used to find closest street segment, then street segment can be identified, but the process becomes time consuming and subject to error
Solution Approach 1:
The patent performs preliminary actions by collecting and comparing address elements before conducting the final segment identification. By pre-processing the address data and comparing it against segment records in advance, the system avoids time-consuming geographic searches while maintaining high accuracy in identifying the correct street segment.
Solution Approach 2:
The patent implements feedback mechanisms where the system verifies the identified street segment by calculating bearing and distance from the point geocode to the segment. This feedback loop ensures both speed and reliability by confirming the correctness of the identified segment without requiring extensive geographic searches.
Data Source
AI summary
Assignment of point level address geocodes to street networks include the steps of entering address data and collecting candidate point data records and segment data record matches for the entered address. Each point data record includes address elements and also includes a geocode. Each segment data record includes a centerline between segment record data points. A determination is made if there is at least one point data record match for the input address. The best point record match for the input address is selected when at least one point data record match is made. The address elements from the point record are compared to any collected segment data records. A determination is made of the best segment record match to the selected best point record and the best segment record match is selected. The selected best segment record is employed and the bearing and distance from the selected best point record is calculated to a point on the centerline of the selected best segment record to determine a geocode for the centerline point.