CN109657713A - A kind of multiple-factor road network method and system based on crowd-sourced road net data - Google Patents
A kind of multiple-factor road network method and system based on crowd-sourced road net data Download PDFInfo
- Publication number
- CN109657713A CN109657713A CN201811508829.7A CN201811508829A CN109657713A CN 109657713 A CN109657713 A CN 109657713A CN 201811508829 A CN201811508829 A CN 201811508829A CN 109657713 A CN109657713 A CN 109657713A
- Authority
- CN
- China
- Prior art keywords
- road
- matching
- target
- candidate
- matched
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 30
- 230000006978 adaptation Effects 0.000 claims abstract description 24
- 238000004364 calculation method Methods 0.000 claims description 19
- UEUXEKPTXMALOB-UHFFFAOYSA-J tetrasodium;2-[2-[bis(carboxylatomethyl)amino]ethyl-(carboxylatomethyl)amino]acetate Chemical compound [Na+].[Na+].[Na+].[Na+].[O-]C(=O)CN(CC([O-])=O)CCN(CC([O-])=O)CC([O-])=O UEUXEKPTXMALOB-UHFFFAOYSA-J 0.000 claims description 19
- 230000003139 buffering effect Effects 0.000 claims description 15
- 101710180366 CDP-L-myo-inositol myo-inositolphosphotransferase Proteins 0.000 claims description 4
- 230000004927 fusion Effects 0.000 abstract description 7
- 238000013441 quality evaluation Methods 0.000 abstract description 3
- 230000008569 process Effects 0.000 description 13
- UEKDBDAWIKHROY-UHFFFAOYSA-L bis(4-bromo-2,6-ditert-butylphenoxy)-methylalumane Chemical compound [Al+2]C.CC(C)(C)C1=CC(Br)=CC(C(C)(C)C)=C1[O-].CC(C)(C)C1=CC(Br)=CC(C(C)(C)C)=C1[O-] UEKDBDAWIKHROY-UHFFFAOYSA-L 0.000 description 7
- 235000013399 edible fruits Nutrition 0.000 description 4
- 241000208340 Araliaceae Species 0.000 description 3
- 235000005035 Panax pseudoginseng ssp. pseudoginseng Nutrition 0.000 description 3
- 235000003140 Panax quinquefolius Nutrition 0.000 description 3
- 238000001514 detection method Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 235000008434 ginseng Nutrition 0.000 description 3
- 238000012800 visualization Methods 0.000 description 3
- 101100412102 Haemophilus influenzae (strain ATCC 51907 / DSM 11121 / KW20 / Rd) rec2 gene Proteins 0.000 description 2
- 101100356020 Haemophilus influenzae (strain ATCC 51907 / DSM 11121 / KW20 / Rd) recA gene Proteins 0.000 description 2
- 101100042680 Mus musculus Slc7a1 gene Proteins 0.000 description 2
- 238000006243 chemical reaction Methods 0.000 description 2
- 238000001914 filtration Methods 0.000 description 2
- PCTMTFRHKVHKIS-BMFZQQSSSA-N (1s,3r,4e,6e,8e,10e,12e,14e,16e,18s,19r,20r,21s,25r,27r,30r,31r,33s,35r,37s,38r)-3-[(2r,3s,4s,5s,6r)-4-amino-3,5-dihydroxy-6-methyloxan-2-yl]oxy-19,25,27,30,31,33,35,37-octahydroxy-18,20,21-trimethyl-23-oxo-22,39-dioxabicyclo[33.3.1]nonatriaconta-4,6,8,10 Chemical compound C1C=C2C[C@@H](OS(O)(=O)=O)CC[C@]2(C)[C@@H]2[C@@H]1[C@@H]1CC[C@H]([C@H](C)CCCC(C)C)[C@@]1(C)CC2.O[C@H]1[C@@H](N)[C@H](O)[C@@H](C)O[C@H]1O[C@H]1/C=C/C=C/C=C/C=C/C=C/C=C/C=C/[C@H](C)[C@@H](O)[C@@H](C)[C@H](C)OC(=O)C[C@H](O)C[C@H](O)CC[C@@H](O)[C@H](O)C[C@H](O)C[C@](O)(C[C@H](O)[C@H]2C(O)=O)O[C@H]2C1 PCTMTFRHKVHKIS-BMFZQQSSSA-N 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 230000001174 ascending effect Effects 0.000 description 1
- 229910002056 binary alloy Inorganic materials 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 238000012937 correction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000001983 electron spin resonance imaging Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000000877 morphologic effect Effects 0.000 description 1
- 238000002203 pretreatment Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000012372 quality testing Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000003786 synthesis reaction Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/22—Matching criteria, e.g. proximity measures
Landscapes
- Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Theoretical Computer Science (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Bioinformatics & Computational Biology (AREA)
- Artificial Intelligence (AREA)
- Evolutionary Biology (AREA)
- Evolutionary Computation (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Life Sciences & Earth Sciences (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention provides a kind of multiple-factor road network method and system based on crowd-sourced road net data, executes initialization, and importing, the setting of matching attribute threshold value and the pretreatment of road net data of matched road net data are participated in including two kinds；Positive match obtains matched reference road, if searching out the candidate matches road for meeting threshold condition, therefrom chooses matching object of the highest road of matching degree as target road including looping through every road in target data；Counter-match obtains matched target road, if searching out the candidate matches road for meeting threshold condition, therefrom chooses matching object of the highest road of matching degree as reference road including looping through every road in reference data；Deduplication operation is carried out to matching result, gets rid of duplicate path adaptation pair, it finally will be in the match information write-in matching result of all matchings pair.The present invention can provide technical support for road net data quality evaluation, road net data fusion etc..
Description
Technical field
The present invention relates to crowd-sourced data application fields, more specifically, being a kind of many based on the realization of multiple-factor road network
The matched method of source road network.
Background technique
In recent years, VGI (VolunteeredGeographicInformation, volunteer's geography information) data are flourishing
Development, more and more volunteers upload the geographical spatial data with abundant information on each VGI platform.Crowd-sourced data cover
Degree is wide, renewal frequency is high, acquisition is convenient and efficient, and every data not only possesses geological information, also possesses attribute more abundant
Information.Especially crowd-sourced road net data, data volume is big, strong real-time.OSM (OpenStreetMap) is flat as most successful VGI
Platform is uploaded for any user, editor, is updated, downloading data.From in April, 2017 in April, 2018, OSM data are by 42
Hundred million it is a plurality of increase to 4,900,000,000, wherein global road data is already more than 100,000,000.
More and more researchers, mechanism and tissue expectation are studied crowd-sourced road net data abundant and are widely answered
With including being evaluated its quality, the variation of road network detection, the fusion of multi-source road net data etc..It studies and answers above
Basis is all related to the matching of crowd-sourced road net data.
By matching crowd-sourced road net data with reference to road net data, range error, the side of each pair of matching road can be determined
To error etc., and then extrapolate gap of the crowd-sourced road network relative to reference road network, the i.e. almost T-stable of crowd-sourced road net data.Such as
Fruit has attribute information accurate, abundant with reference to road net data, can also further measure the attribute information of crowd-sourced road net data
Integrity degree and accuracy.Using areal, the matching of the crowd-sourced road net data of different times, inspection can be updated to road
It surveys, to excavate new road, the abundant of road net data can also be assisted.Areal, not homologous road net data are carried out
Matching, both can compare the difference between road, i.e., for relatively other roads, road that same source data does not lack；Crowd-sourced road
Network data is matched with reference to road net data, can also calculate the integrality of crowd-sourced road net data.Not homologous road net data is carried out
Matching, excavates the not homologous road data lacked, so that it may make up mutually, integrate, then carry out the processing such as topological correction, moreover it is possible to
Auxiliary realizes the fusion of multi-source road network data.
Crowd-sourced road net data quality is different, and single matching object that road is measured from one aspect may not be able to be found
Correctly as a result, generally requiring to carry out comprehensive descision from many aspects.Study the science of path adaptation index and each matching index
Extracting mode could ensure the correctness of path adaptation.The distance between present invention combination road, direction difference and buffer area weight
Folded degree etc. matches index, calculates the matching degree between road, can be improved the matching accuracy of road.In addition it designs and opens
Send out crowd-sourced road net data matching system, can visualized registration road and show it is calculated it is each matching to matching attribute, matching
Degree can provide technical support for road net data quality evaluation, fusion etc..
Summary of the invention
In view of the above-mentioned problems, the present invention proposes that a kind of multiple-factor road network algorithm that is based on realizes that crowd-sourced road network is matched
Technical solution.
Technical solution of the present invention provides a kind of multiple-factor road network method based on crowd-sourced road net data, including as follows
Step,
Step 1, initialization, including two kinds of importings for participating in matched road net data, the setting of matching attribute threshold value and road
The pretreatment of network data；
Step 2, positive match obtain matched reference road, such as including looping through every road in target data
Fruit searches out the candidate matches road for meeting threshold condition, therefrom chooses matching of the highest road of matching degree as target road
Object；
Step 3, counter-match obtain matched target road, such as including looping through every road in reference data
Fruit searches out the candidate matches road for meeting threshold condition, therefrom chooses matching of the highest road of matching degree as reference road
Object；
Step 4 carries out deduplication operation to the matching result in step 2 and step 3, gets rid of duplicate path adaptation
It is right, the match information of the final all matchings pair of output.
Moreover, the matched realization of single road is as follows in step 2,
(1) current maximum matching degree is indicated with MaxMatchVal first, initial value is the minimum value of double types value
DB_Min；
(2) reference road is traversed, judge target road and reference road extends out whether boundary rectangle EMBR intersects, if
Intersection, then it is assumed that be the candidate reference road of target road；
(3) the SM_HD distance of target road and candidate reference road is calculated, and obtains matching section；If calculated SM_
HD distance is more than or equal to SM_HD distance threshold DisTol, then continues to judge next candidate reference road；Conversely, executing next
Step；Wherein, SM_HD indicates intermediate value Hausdorff distance；
(4) the deflection difference Angle for calculating the respective matching section of target road and candidate reference road, if Angle is big
In being equal to respective direction angular difference value threshold value A ngTol, then continue to judge next candidate reference road；Conversely, performing the next step；
(5) it is buffering radius with SM_HD distance, establishes the buffering of the respective matching section of target road and candidate reference road
Area uses the ratio of buffer area intersection area and union area as the two degree of overlapping；
(6) the matching degree MatchVal of current candidate matching pair is calculated, if matching degree is less than matching degree threshold value
MatchTol or less than or equal to current maximum matching degree MaxMatchVal, then continue to match next candidate reference road, instead
MatchVal is assigned to MaxMatchVal；
(7) after having matched all reference roads, compare the size of MaxMatchVal and MatchTol.If
MaxMatchVal is less than MatchTol, illustrates then to continue to match next entry not with the matched reference road of the target road
Mark road；Conversely, recording and exporting the match information of matching pair.
Moreover, the matched realization of single road is as follows in step 3,
(1) current maximum matching degree is indicated with MaxMatchVal first, initial value is the minimum value of double types value
DB_Min；
(2) target road is traversed, judge reference road and target road extends out whether boundary rectangle EMBR intersects, if
Intersection, then it is assumed that be the candidate target road of reference road；
(3) the SM_HD distance of reference road and candidate target road is calculated, and obtains matching section；If calculated SM_
HD distance is more than or equal to SM_HD distance threshold DisTol, then continues to judge next candidate target road；Conversely, executing next
Step；Wherein, SM_HD indicates intermediate value Hausdorff distance；
(4) the deflection difference Angle for calculating the respective matching section of reference road and candidate target road, if Angle is big
In being equal to respective direction angular difference value threshold value A ngTol, then continue to judge next candidate target road；Conversely, performing the next step；
(5) it is buffering radius with SM_HD distance, establishes the buffering of the respective matching section of reference road and candidate target road
Area uses the ratio of buffer area intersection area and union area as the two degree of overlapping；
(6) the matching degree MatchVal of current candidate matching pair is calculated, if matching degree is less than matching degree threshold value
MatchTol or less than or equal to current maximum matching degree MaxMatchVal, then continue to match next candidate target road, instead
MatchVal is assigned to MaxMatchVal；
(7) after having matched all target roads, compare the size of MaxMatchVal and MatchTol.If
MaxMatchVal is less than MatchTol, illustrates then to continue to match next ginseng not with the matched target road of the reference road
Examine road；Conversely, recording and exporting the match information of matching pair.
Moreover, the pretreatment of the road net data, unification, every road including spatial frame of reference extend out boundary rectangle
The calculating of EMBR and the increase of road node.
Moreover, matching degree calculates, it is for measuring the whether matched index of a pair of of road, the calculation formula of matching degree is Wherein, MPCT [i] is indicated
The matching degree of i-th of matching pair, SMHD [i] indicate that the intermediate value Hausdorff distance between i-th of matching pair, Angle [i] indicate the
Angle between i matching pair, IPCT [i] indicate matching to buffer area degree of overlapping, ω 1, ω 2, ω 3 be respectively SM_HD distance,
It matches road angle and matches the preset weights to buffer area degree of overlapping, and ω 1+ ω 2+ ω 3=1.
The present invention correspondingly provides a kind of multiple-factor road network system based on crowd-sourced road net data, including such as lower die
Block,
Initialization module, for two kinds of importings for participating in matched road net data, the setting of matching attribute threshold value and road network
The pretreatment of data；
Positive match module obtains matched reference road, if sought for looping through every road in target data
The candidate matches road for meeting threshold condition is found, matching pair of the highest road of matching degree as target road is therefrom chosen
As；
Counter-match module obtains matched target road, if sought for looping through every road in reference data
The candidate matches road for meeting threshold condition is found, matching pair of the highest road of matching degree as reference road is therefrom chosen
As；
Deduplication module is got rid of for carrying out deduplication operation to the matching result in positive match module and counter-match module
Duplicate path adaptation pair, the match information of the final all matchings pair of output.
Moreover, the matched realization of single road is as follows in positive match module,
(1) current maximum matching degree is indicated with MaxMatchVal first, initial value is the minimum value of double types value
DB_Min；
(2) reference road is traversed, judge target road and reference road extends out whether boundary rectangle EMBR intersects, if
Intersection, then it is assumed that be the candidate reference road of target road；
(3) the SM_HD distance of target road and candidate reference road is calculated, and obtains matching section；If calculated SM_
HD distance is more than or equal to SM_HD distance threshold DisTol, then continues to judge next candidate reference road；Conversely, executing next
Step；Wherein, SM_HD indicates intermediate value Hausdorff distance；
(4) the deflection difference Angle for calculating the respective matching section of target road and candidate reference road, if Angle is big
In being equal to respective direction angular difference value threshold value A ngTol, then continue to judge next candidate reference road；Conversely, performing the next step；
(5) it is buffering radius with SM_HD distance, establishes the buffering of the respective matching section of target road and candidate reference road
Area uses the ratio of buffer area intersection area and union area as the two degree of overlapping；
(6) the matching degree MatchVal of current candidate matching pair is calculated, if matching degree is less than matching degree threshold value
MatchTol or less than or equal to current maximum matching degree MaxMatchVal, then continue to match next candidate reference road, instead
MatchVal is assigned to MaxMatchVal；
(7) after having matched all reference roads, compare the size of MaxMatchVal and MatchTol.If
MaxMatchVal is less than MatchTol, illustrates then to continue to match next entry not with the matched reference road of the target road
Mark road；Conversely, recording and exporting the match information of matching pair.
Moreover, the matched realization of single road is as follows in counter-match module,
(1) current maximum matching degree is indicated with MaxMatchVal first, initial value is the minimum value of double types value
DB_Min；
(2) target road is traversed, judge reference road and target road extends out whether boundary rectangle EMBR intersects, if
Intersection, then it is assumed that be the candidate target road of reference road；
(3) the SM_HD distance of reference road and candidate target road is calculated, and obtains matching section；If calculated SM_
HD distance is more than or equal to SM_HD distance threshold DisTol, then continues to judge next candidate target road；Conversely, executing next
Step；Wherein, SM_HD indicates intermediate value Hausdorff distance；
(4) the deflection difference Angle for calculating the respective matching section of reference road and candidate target road, if Angle is big
In being equal to respective direction angular difference value threshold value A ngTol, then continue to judge next candidate target road；Conversely, performing the next step；
(5) it is buffering radius with SM_HD distance, establishes the buffering of the respective matching section of reference road and candidate target road
Area uses the ratio of buffer area intersection area and union area as the two degree of overlapping；
(6) the matching degree MatchVal of current candidate matching pair is calculated, if matching degree is less than matching degree threshold value
MatchTol or less than or equal to current maximum matching degree MaxMatchVal, then continue to match next candidate target road, instead
MatchVal is assigned to MaxMatchVal；
(7) after having matched all target roads, compare the size of MaxMatchVal and MatchTol.If
MaxMatchVal is less than MatchTol, illustrates then to continue to match next ginseng not with the matched target road of the reference road
Examine road；Conversely, recording and exporting the match information of matching pair.
Moreover, the pretreatment of the road net data, unification, every road including spatial frame of reference extend out boundary rectangle
The calculating of EMBR and the increase of road node.
Moreover, matching degree calculates, it is for measuring the whether matched index of a pair of of road, the calculation formula of matching degree is Wherein, MPCT [i] indicates the
The matching degree of i matching pair, SMHD [i] indicate that the intermediate value Hausdorff distance between i-th of matching pair, Angle [i] indicate i-th
Angle between a matching pair, IPCT [i] indicate matching to buffer area degree of overlapping, ω 1, ω 2, ω 3 be respectively SM_HD distance,
It matches road angle and matches the preset weights to buffer area degree of overlapping, and ω 1+ ω 2+ ω 3=1.
The invention proposes the multiple-factor road network technical solutions based on crowd-sourced road data, and number of matches is complete,
It is fast with speed, and facilitate road net data quality evaluation, road net data fusion etc..Most of all, the present invention is in order to improve
Whether the matched accuracy in road is matched using multiple-factor comprehensive descision road, and is measured with relatively reasonable calculation
Each matching attribute.After road network, can assist realizing the fusion of multi-source road network data, road net data attribute information abundant and
Therefore variation detection of road network etc. studies road network matching algorithm, improves its matched accuracy and integrality, have weight
Want meaning.
Detailed description of the invention
Fig. 1 is the matched overall procedure of multi-source road net data of the embodiment of the present invention.
Fig. 2 is the matched detail flowchart of single road of the embodiment of the present invention.
Fig. 3 is that EMBR of the embodiment of the present invention calculates schematic diagram.
Fig. 4 is that SM_HD of the embodiment of the present invention calculates schematic diagram.
Fig. 5 is road convex polygon calculation flow chart of the embodiment of the present invention.
Fig. 6 is convex polygon sample calculation figure of the embodiment of the present invention.
Fig. 7 is MABR sample calculation figure of the embodiment of the present invention.
Specific embodiment
To make the objectives, technical solutions, and advantages of the present invention clearer, below in conjunction with specific implementation case, and join
According to attached drawing, the present invention is described in more detail.
The present invention considers the unicity for matching index in other road network methods and matching attribute calculation not
Rationally place, using the SMHD after improving apart from the factor, the deflection difference factor and the degree of overlapping factor, synthesis extracts two road
Matching degree, and specifically calculate the matching section of two matching roads.Fusion of the invention for multi-source road network data, road network
Quality testing, abundant and road network variation detection of road net data attribute information etc. are of great significance.
Referring to Fig. 1, it is contemplated that the ranging offset of vector road, direction offset etc., the invention proposes it is a kind of using mostly because
The sub- whether matched method of COMPREHENSIVE CALCULATING multi-source road data.The embodiment of the present invention uses OpenStreetMap (OSM) road network number
According to as target data, US Geological Survey's (USGS) road net data effectively discloses multiple-factor road as reference data
Net matched reasonability.
A kind of multiple-factor matching process based on multi-source road net data provided in an embodiment of the present invention, as shown in Figure 1.Its
In, if target road data have N road, reference road data have M road, and i expression currently participates in matched target road
Label, Tar_i is i-th target road, and i++ expression, which continues to remove a target road, participates in matching, and i < N indicates target track
Road has matched not yet, therefore will continue to matching and go down, and specific matching step is as follows:
Step 1, initialization, including two kinds of importings for participating in matched road net data, the setting of matching attribute threshold value and road
The pretreatment of network data.Wherein, it participates in matched road net data and is divided into target data and reference data；Matching attribute threshold value includes
SM_HD distance threshold DisTol and matching are specific real to direction angular difference value threshold value A ngTol and matching degree threshold value MatchTol
Shi Shi, can be previously according to the value for needing to be arranged each threshold value, and wherein SM_HD indicates intermediate value Hausdorff distance, matches to direction
Angle difference threshold namely matching section angle threshold value；The pretreatment operation of road net data, as needed, it may include spatial frame of reference
Unified, every road extends out the operation such as the calculating of boundary rectangle (EMBR), increase of road node.
Step 2, positive match loop through every road in target data, obtain matching reference road.Such as
Fruit searches out the candidate matches road for meeting threshold condition, therefrom chooses the highest reference road of matching degree as target road
Match object；Meanwhile the matching result information of each path adaptation pair being recorded；
Wherein, single road matching process is as follows:
(1) current maximum matching degree is indicated with MaxMatchVal first, initial value is the minimum value of double types value
DB_Min；In embodiment, defining MatchVal is the matching degree between target road and candidate reference road, and
MaxMatchVal is the maximum value of the matching degree between target road and all candidate reference roads, i.e. target road and final
Matching degree between matched reference road；
(2) reference road is traversed, judges whether target road intersects with the EMBR of reference road, if intersection, by it
Matching candidate road as target road；
(3) the SM_HD distance of target road and candidate reference road is calculated, and obtains the two matching section；If calculated
SM_HD distance be more than or equal to SM_HD distance threshold DisTol, then continue to judge next candidate reference road；Conversely, executing
In next step；
(4) the deflection difference of the respective matching section of target road and candidate reference road, i.e. Angle, if Angle are calculated
More than or equal to deflection difference threshold AngTol, then continue to judge next candidate reference road；Conversely, performing the next step；
(5) it is buffering radius with SM_HD, establishes the buffer area of the respective matching section of target road and candidate reference road, use
The ratio of buffer area intersection area and union area is as the two degree of overlapping；
(6) the matching degree MatchVal of current candidate matching pair is calculated, if matching degree is less than threshold value MatchTol or small
In being equal to MaxMatchVal, then continues to match next candidate reference road, otherwise MatchVal is assigned to
MaxMatchVal；
(7) after having matched all reference roads, compare the size of MaxMatchVal and MatchTol.If
MaxMatchVal is less than MatchTol, illustrates then to continue to match next entry not with the matched reference road of the target road
Mark road；Conversely, recording and exporting the match information of matching pair.
For the sake of ease of implementation, it is as follows to provide more specific process:
As shown in Figure 2, wherein k indicates that the label for currently participating in matched reference road, i.e. Re_k indicate the reference of kth item
Road；K++ expression continues to match next reference road；K < M indicates that reference road has traversed not yet, can continue to match next
Reference road.Execute following steps,
Step 2.1, it inputs the target road Tar_i of current matching and refers to road net data, it is described to refer to road net data
In include M reference road；
Step 2.2, variable k=0, MaxMatchVal=DB_Min are enabled；
Step 2.3, it calculates the target road Tar_i of current matching and currently participates in matched reference road Re_k
It is worth Hausdorff distance SM_HD value, and obtains the two matching section；
Step 2.4, judge the target road Tar_i of current matching and currently participate in the outer of matched reference road Re_k
Expand whether boundary rectangle EMBR intersects, if intersection, using Re_k as the matching candidate road of target road, enters step
2.5, otherwise return step 2.3, currently participate in matched reference road Re_k based on next and continue to match；
Step 2.5, judged according to step 2.3 gained SM_HD, if calculated SM_HD distance is less than corresponding threshold
Value DisTol enters step 2.6, otherwise return step 2.3, currently participates in matched reference road Re_k based on next and continues
It is matched；
Step 2.6, the side of the respective matching section of the target road Tar_i and matching candidate road Re_k of current matching is calculated
2.7 are entered step, otherwise return step 2.3 if Angle is less than AngTol to angular difference value Angle, it is current based on next
Matched reference road Re_k is participated in continue to match；
Step 2.7, the degree of overlapping of the target road Tar_i and matching candidate road Re_k of current matching are calculated, it is described
The calculation of degree of overlapping is, using SM_HD as radius, establishes the target road Tar_i and matching candidate road of current matching
The buffer area of the respective matching section of Re_k uses the ratio of buffer area intersection area and union area as the two degree of overlapping；
Step 2.8, current candidate matching is calculated to (the i.e. target road Tar_i and matching candidate road of current matching
Re_k matching degree MatchVal), judges whether matching degree MatchVal is more than or equal to respective threshold MatchTol, is, enters
Step 2.9, otherwise then return step 2.3, currently participate in matched reference road Re_k based on next and continue to match；
Step 2.9, judge whether matching degree MatchVal is greater than current maximum matching degree MaxMatchVal, be to enable
MatchVal is assigned to current maximum matching degree MaxMatchVal, then returned by MatchVal=MaxMatchVal
Step 2.3, matched reference road Re_k is currently participated in based on next to continue to match；Otherwise direct return step 2.3,
Matched reference road Re_k is currently participated in based on next to continue to match；
Step 2.10, k++, i.e. update k=k+1, then judge whether that k is less than M, if then return step 2.3, are based on down
One currently participates in matched reference road Re_k and continues to match, if otherwise entering step 2.11；
Step 2.11, judge whether current maximum matching degree MaxMatchVal is less than respective threshold MatchTol, explanation
Not with the matched reference road of the target road, then continue to match next target road；Conversely, the matching of matching pair is believed
Breath is recorded and is exported.
Step 3, counter-match after completing step 2, loop through every road in reference data, obtain matching
Target road, carry out road counter-match and if searching out the candidate matches road for meeting threshold condition therefrom choose matching degree
Matching object of the highest target road as reference road.Calculate with the matched target road of every reference road, together
When record matching pair matching result；Every reference road matching process is the same as target road matching process in step 2.
Substantially it is accomplished by
(1) current maximum matching degree is indicated with MaxMatchVal first, initial value is the minimum value of double types value
DB_Min；
(2) target road is traversed, judge reference road and target road extends out whether boundary rectangle EMBR intersects, if
Intersection, then it is assumed that be the candidate target road of reference road；
(3) the SM_HD distance of reference road and candidate target road is calculated, and obtains matching section；If calculated SM_
HD distance is more than or equal to SM_HD distance threshold DisTol, then continues to judge next candidate target road；Conversely, executing next
Step；Wherein, SM_HD indicates intermediate value Hausdorff distance；
(4) the deflection difference Angle for calculating the respective matching section of reference road and candidate target road, if Angle is big
In being equal to respective direction angular difference value threshold value A ngTol, then continue to judge next candidate target road；Conversely, performing the next step；
(5) it is buffering radius with SM_HD distance, establishes the buffering of the respective matching section of reference road and candidate target road
Area uses the ratio of buffer area intersection area and union area as the two degree of overlapping；
(6) the matching degree MatchVal of current candidate matching pair is calculated, if matching degree is less than matching degree threshold value
MatchTol or less than or equal to current maximum matching degree MaxMatchVal, then continue to match next candidate target road, instead
MatchVal is assigned to MaxMatchVal；
(7) after having matched all target roads, compare the size of MaxMatchVal and MatchTol.If
MaxMatchVal is less than MatchTol, illustrates then to continue to match next ginseng not with the matched target road of the reference road
Examine road；Conversely, recording and exporting the match information of matching pair.
Step 4 carries out deduplication operation to the matching result in step 2 and step 3, that is, gets rid of duplicate road
Pairing finally exports the match information of all matchings pair.Wherein, the reason of carrying out road counter-match operation in step 3 is: can
It the case where capable of being matched simultaneously with a plurality of reference road there are a target road, at this time if only carrying out positive match, will lead to
Only a reference road is matched with target road, this allows for final matching results and there is the case where leakage matching.Counter-match
Purpose is exactly in order to avoid leakage matching, as much as possible realization road network complete match.
When it is implemented, process may be configured as:
Step 1, it inputs target road net data and refers to road net data, include N target in the target road net data
Road, described refer to includes M reference road in road net data；Carry out target road net data and the data with reference to road net data
Pretreatment；
When it is implemented, may assume data set A and data set B, first using data set A as target road net data, with data
Collecting B is while road network factor threshold to be arranged with reference to road net data, including SM_HD distance threshold DisTol and matching other side
To angular difference value threshold value A ngTol and matching degree threshold value MatchTol, positive match is carried out.
Step 2, positive match is carried out, realization is as follows,
1) variable i=0 is enabled, indicates to start positive match first entry mark road；
2) it is directed to the target road Tar_i of current matching, matching reference road is obtained, meets threshold if searched out
The candidate matches road of value condition therefrom chooses matching object of the highest road of matching degree as target road, and recording should
The matching result information of path adaptation pair is otherwise directly entered step 3) subsequently into step 3)；
3) then, i++ judges whether that i is less than N, if then return step 2 even i=i+1), it is current for next
Matched target road Tar_i continues to match, if otherwise entering step 3.
Step 3, counter-match is carried out；
It is to execute step again with reference to road net data with data set A at this point, can be considered using data set B as target road net data
Rapid 2.It can simplify process realization.
Step 4, the repeated matching pair in step 2 and step 3 acquired results is removed, final matching result is exported.
For the sake of ease of implementation, introduce embodiment preprocess method and each matching attribute calculation:
Boundary rectangle EMBR calculating is extended out, is the efficiency in order to improve road network.As shown in figure 3, first according to road
The coordinate value (X, Y) of node calculates the minimax X and Y coordinates in all coordinates, i.e. XMin, XMax, YMin, YMax, then
It is that node obtains road with four A (XMin, YMin), B (XMin, YMax), C (XMax, YMax), D (XMax, YMin) points
(Road) boundary rectangle MBR.Then allow each edge of MBR all toward the distance threshold DisTol for extending out 1/2, i.e., with A1 (XMin-
DisTol/2, YMin-DisTol/2), B1 (XMin-DisTol/2, YMax+DisTol/2), C1 (XMax+DisTol/2, YMax
+ DisTol/2), four points of D1 (XMax+DisTol/2, YMin-DisTol/2) be node obtain road extend out boundary rectangle
EMBR.If the EMBR in two road is non-intersecting, within the scope of threshold value DisTol, the two certainly not road of the same name.So
After rejecting, it is greatly improved matching efficiency, avoids unnecessary calculating.
Intermediate value Hausdorff distance SM_HD is calculated, and SM_HD calculation formula is as follows:
Length (Road1) < Length (Road2)
Wherein, Road1 is more short-track road, and Road2 is longer road, and p1 is the node of Road1, and p2 is the node of Road2,
Length (Road1) indicates the length of Road1, and Length (Road2) indicates the length of Road2,It indicates
The shortest distance of all node p2 and Road1 interior joint p1 in Road2,Indicate the intermediate value of access column.SM_
HD(Road1, Road2)It indicates: when Road1 length is less than Road2, being found out in the node of Road2 nearest with node each in Road1
Point, i.e. match point, and both calculate spacing chooses whether to retain matching double points spacing further according to filtering rule, takes all mistakes
The intermediate value of the ordered series of numbers of matching double points spacing composition after filter.Filter indicates filtering rule: when multiple nodes of a road are same
When being matched with the first node or tail node of another road, as have respectively on two road in Fig. 4 node a1, a2, a3, a4 and
B1, b2, b3, b4, b5, a1 and a2 with b1 Knot Searching, only retain nearest matching double points, i.e. a2 and b1 simultaneously.It calculates in this way
SM_HD distance out can more reflect the distance in two road.
Road node increases, and is the precision in order to improve road network, will be according to default before calculating SM_HD distance
Spacing distance, if on original road increase passive node, keep the calculated result of distance more accurate.After road node increase, meter
When calculating SM_HD, the matching degree of road Knot Searching pair is higher, and calculated SM_HD also can more rationally.
Matching section direction difference calculates, and is deviated for measuring the direction in two road, calculation are as follows: with two participations
Angle margin of the absolute value of the difference at the longitudinal direction angle of the minimum circumscribed rectangle (MABR) with path adaptation section as matching pair
Figureofmerit, wherein MABR is description polygon or the common morphological parameters of thread-shaped body.The key for calculating deflection difference is
The calculating of the convex polygon and MABR of path adaptation section.Convex polygon needs former according to " angle is minimum, distance is maximum " before calculating
Then road node is ranked up, to obtain the corresponding polygon of road, specific practice is first to find out all y-coordinate values minimums
Node, then therefrom select the smallest node of x coordinate value as polygon starting point；Then other nodes are calculated and starting point connects
Other nodes are first come starting point rear with secondary according to angle is ascending, if deposited by line and horizontal angle and distance
In the identical situation of angle, just rejects apart from small node, only retain wherein apart from maximum node.
Referring to the schematic diagram of Fig. 5 convex polygon calculation flow chart and Fig. 6, for the sake of ease of implementation, if path coordinate
Group Array (x, the y-coordinate of a road node are recorded in Array with adjacent values) is to calculate according to above-mentioned principle of ordering
Road polygon coordinate group；NCount indicates road nodal point number；NCount < 4 indicates that present road only has two or three knots
Point, also just without calculating convex polygon；P0 indicates the starting point that convex polygon calculates, that is, the smallest node of y in road node；
BHasConcave is the variable of bool type, for identifying in Array array whether have concave point；I indicates currently to participate in road
The node serial number of calculating；P0-pi+1 indicates the 0th line segment being linked to be with i+1 road node；Pi-pi+2 indicates i-th of He
The line segment that the i-th+2 road nodes are linked to be；BHasConcave=true indicates that i-th of the node currently calculated is concave point；i++
Expression continues to calculate next node；I+3 < nCount indicates that road node has not traversed, need to continue to traverse next node.Tool
The process of body is as follows:
(1) road set of coordinates Array is inputted, distance maximum principle minimum according to angle reorders to Array, judges
Whether road nodal point number nCount is less than 4, if being, without calculating convex polygon, terminates process, otherwise performs the next step；
(2) the smallest node of y in convex polygon node is selected if minimum y value corresponds to multiple nodes to select path coordinate
The smallest node of x value is as starting point p0 in group Array；
(3) first assume bool variable bHasConcave=false, that is, assume that the node currently calculated is not concave point；Currently
The node serial number i of calculating initializes i=1；
(4) judge whether line segment p0-pi+1 and pi-pi+2 have intersection point, have, enter step (6), continue to traverse next
Node does not perform the next step rapid (5) then；
(5) this period p0-pi+1 and pi-pi+2 do not have intersection point, judge that pi+1 node is concave point, and from Array array
Remove the corresponding coordinate value of pi+1 node, while bHasConcave is changed to true, enter step (6), continues to traverse next
Node；
(6) i++ enables i=i+1；Judge whether i+3 be less than < nCount, if then return step (4) continue to traverse it is next
A node, if otherwise illustrating, all node traverses are completed, and enter step (7)；
(7) after all node traverses are complete, judge whether bHasConcave is equal to true, if it does, the current meter of explanation
Calculating has node in round be concave point, then return step (3), re-execute the steps (3)-based on current path coordinate group Array
(5)；If bHasConcave=false, Array array is returned to, the orderly coordinate points which retains connect just
It is convex polygon.
As shown in fig. 6, have road node p1, p2, p3, p4, p5, p6, p7 in path coordinate group Array, the calculation according to Fig. 5
Method process, p3, p6 are concave point in original point, obtain the convex polygon P of road network L after rejecting and renumbeing to road node
={ p1, p2, p3, p4, p5 }.After obtaining convex polygon, minimum circumscribed rectangle MABR can be calculated.
As shown in fig. 7, for the sake of ease of implementation, the calculating of MABR is illustrated by taking convex polygon P as an example, it is assumed that convex polygon
Shape P has node p1, p2, p3, p4, p5, the calculation process of MABR are as follows:
(1) it first arbitrarily determines one and plays initial line, it is assumed that be p3p4, be hang down vertical line L3, L4 for being p3p4 with p3, p4；
(2) first judge whether L3 passes through polygon, if it is not, then retaining；If it is, L3 is translated along the direction p4p3,
Until the P2 point intersection location with distalmost end, obtains new vertical line L2 at this time；Similarly judge L4, is obtained at this time along the direction p3p4
New vertical line L5；
(3) calculate by other points (p1, p2, p5) on convex polygon and the line and convex polygon parallel with p3p4 whether phase
It hands over, discovery is to meet by the L1 of p1；
(4) at this time by the rectangle of L1, L2, L5, p3p4 place rectilinear(-al), i.e. ABCD is exactly the external of the convex polygon
Rectangle Rec1；
(5) similarly, above step is repeated, the corresponding boundary rectangle of different side p2p3, p1p2, p5p1, p4p5 is successively calculated
Rec2,Rec3,Rec4,Rec5；
(6) calculate Rec1, Rec2, Rec3, Rec4, Rec5 area, take wherein the smallest rectangle of area it is convex more as this
The minimum circumscribed rectangle of side shape.
Matching degree calculates, and is for measuring the whether matched index of a pair of of road, the calculation formula of matching degree is Wherein, MPCT [i] is indicated
The matching degree of i-th of matching pair, SMHD [i] indicate that the intermediate value Hausdorff distance between i-th of matching pair, Angle [i] indicate the
Angle between i matching pair, ipCT [i] indicate matching to buffer area degree of overlapping, ω 1, ω 2, ω 3 be respectively SM_HD distance,
Road angle and matching are matched to the weight of buffer area degree of overlapping, and ω 1+ ω 2+ ω 3=1, when specific implementation can set in advance
Value is set, ω 1=0.25, ω 2=0.15, ω 3=0.60 are preferably provided in embodiment.
Provided in an embodiment of the present invention a kind of using the multiple-factor progress matched method of road network, detailed process is realized visual
For the following steps are included:
Step 1, road net data to be matched and the acquisition with reference to road net data, the main side for passing through download online or purchase
Formula.After having obtained data, it may also need to convert the format of data, such as OpenStreetMap data unprocessed form
It is xml format or binary system pbf format.General vector data form, the i.e. ShapeFile of ESRI are supported in embodiment
(.shp) or two kinds of vector data forms of FileGeoDatabase (.gdb), both data formats are currently used the widest
General and general vector data form.The road net data to be matched of the present embodiment comes from the official website OpenStreetMap, download address
For (https: //www.openstreetmap.org/), after downloading, classification and format are carried out using OSMTranslator tool
Conversion, category conversion obtain OSM road net data.US Geological Survey USGS is come from reference to road net data, download link is
https://viewer.nationalmap.gov/basic/#productSearch.Choose USA New York Xue Cheng in trial zone.
Step 2, road net data spatial frame of reference is unified.The georeferencing of OSM data and USGS data be it is different, because
This needs to do the unification of georeferencing, is all converted to WGS84 earth coordinates here, because if being unified for plane coordinate system,
It can lead to the generation of projection error because of projective transformation.
Step 3, road net data equidistantly extends out boundary rectangle calculating.Believed using the coordinate that GDAL/OGR reads every road
Breath calculates the boundary rectangle of road, the i.e. boundary rectangle of longitude and the encirclement of latitudinal minimax coordinate value, further according to
The SMHD distance threshold of setting, equidistantly extends out the boundary rectangle.The step is to accelerate subsequent matching speed.Because of road
Extend out boundary rectangle it is disjoint when, the SMHD distance in two road reduces other necessarily more than distance threshold
Calculating with index.
Step 4, road net data node increases operation.The embodiment of the present invention select Hausdorff distance measurement two road it
Between distance, in order to keep the distance calculated more reasonable, at each section of every road at interval of 5 meters of increases, one node so that
Road circuit node is more, and the matched node that when matching finds is more reasonable accurate.
Step 5, the distance of positive match calculates.On the basis of every OSM road, finds and extend out what boundary rectangle intersected with it
USGS road, and the matching double points and its spacing of every USGS road Yu OSM road are calculated, it will be in matching double points spacing collection
It is worth the spacing as two road, if spacing has been more than distance threshold, then it is assumed that two road are unlikely to be road of the same name, instead
It, carries out in next step.I.e. positive match when, using OSM road as target road, using USGS road as reference road.
Step 6, the matching section of positive match calculates.Calculated in step 5 SMHD apart from while, available two road
The match point of head and the tail node is exactly in two road by the intermediate match point point of head and the tail match point and head and the tail to combining
With section.
Step 7, the angle calculation of positive match.To the node of two road every in step 5 matching section according to " angle is minimum,
Distance is maximum " principle progress rule compositor, then calculate the convex closure of path adaptation section.After the completion of convex closure calculates, two are calculated
The minimum area boundary rectangle of path adaptation section.According to the difference in length of minimum area boundary rectangle, determines long side and calculate
Then deflection of the deflection of long side as path adaptation section out compares the deflection difference threshold of two road matching section,
If it exceeds threshold range, then determine that two road are unmatched, otherwise carry out in next step.
Step 8, the Overlapping Calculation of positive match.According to road spacing calculated in step 5, to two road matching section
Buffer zone analysis is carried out, the buffer area of two road matching section is respectively obtained, then calculates the intersection and friendship of two buffer areas
The area of collection, then the union of two buffer areas and the area of union are calculated, upper union area is removed with intersection area, as two
The degree of overlapping of road.
Step 9, the matching degree of positive match calculates.Combining step 5 is calculated to the matching index in step 8 using matching degree
Formula calculates the matching degree of each pair of matching road, compares the size of path adaptation degree Yu matching degree threshold value, and if more than
With degree threshold value, then it is assumed that two road are unmatched, otherwise two road are regarded as possible matched.
Step 10, the matching road of positive match determines.Loop through the matching that every USGS road and OSM road has been calculated
After degree, the maximum matching road as OSM road of matching degree is chosen.
Step 11, record matching information.After the completion of OSM path adaptation, the matching index of each path adaptation pair is recorded
Get off, to be calculated for subsequent road integrality etc..
Step 12, counter-match.After the completion of positive match, on the basis of USGS road, repeats step 5 and arrive step 11, obtain every
The matching object of USGS road does not record this unpaired message when certain matching in positive match to occurring, and avoids
The repetition of pairing records.I.e. counter-match when, using OSM road as reference road, using USGS road as target road.
Step 13, the visualization of matching result.Using the path adaptation system in the present invention, each pair of matching road can be positioned
Road.Each pair of matching road is chosen, system can show the match information of path adaptation pair, including road spacing, road angle, road
The information such as road degree of overlapping and road integrity degree.The each matching index of road is chosen, the statistics letter of each matching index can be viewed
Breath, including average value, standard deviation etc..In addition it can calculate the path adaptation integrality of two kinds of data sources, that is, participate in matched
The total length ratio of OSM path adaptation section total length and USGS path adaptation section.Road to be matched can be measured out by the ratio
The integrality of road OSM road.According to the standard deviation of the indexs such as matching road spacing, angle, it is opposite that OSM road can be quantified
The degrees of offset and error of USGS road provide quantitative judging result for the evaluation of OSM road almost T-stable.
When it is implemented, the operation of software technology implementation process can be used, modularization can also be realized using software technology
System.The embodiment of the present invention correspondingly provides a kind of multiple-factor road network system based on crowd-sourced road net data, including as follows
Module,
Initialization module, for two kinds of importings for participating in matched road net data, the setting of matching attribute threshold value and road network
The pretreatment of data；
Positive match module obtains matched reference road, if sought for looping through every road in target data
The candidate matches road for meeting threshold condition is found, matching pair of the highest road of matching degree as target road is therefrom chosen
As；
Counter-match module obtains matched target road, if sought for looping through every road in reference data
The candidate matches road for meeting threshold condition is found, matching pair of the highest road of matching degree as reference road is therefrom chosen
As；
Deduplication module is got rid of for carrying out deduplication operation to the matching result in positive match module and counter-match module
Duplicate path adaptation pair exports the match information of all matchings pair of final gained.
Each module specific implementation is referring to corresponding steps, and it will not go into details by the present invention.
When it is implemented, can also divide functional mode that realization system is arranged, including such as lower die according to user's use habit
Block:
Vector data operation module, for the importing of vector road net data, reading, scaling, roaming, inquiry, visualization etc.,
User is facilitated intuitively to operate, read, analyze, inquire road net data；
Road network module finds path adaptation pair of the same name based on multiple-factor road network algorithm, and records road of the same name
The matching result of matching pair；
As a result output module shows matching result in the form of chart etc. for the visualization of matching result；System unilateral side column
Table records line by line and shows the matching result of all matchings pair, chooses certain matching pair as a result, system by mouse-click
It is automatically positioned and shows the target road and reference road of the matching centering, while showing the matching section in two road.
Road network module is accomplished by
The threshold value of interface input road matching attribute；
All target roads and reference road are carried out unified georeferencing, calculating EMBR and increase the pretreatments such as node to grasp
Make；Specifically, for the road of non-WGS84 coordinate system, its node coordinate is converted to the coordinate of WGS84, conversely, without turning
It changes；According to certain spacing distance, if increasing passive node to all target roads and reference road；
It executes road network positive match and counter-match operates.
The above embodiment is a preferred embodiment of the present invention, but embodiments of the present invention are not by above-described embodiment
Limitation, other any not violate made changes, modifications, substitutions, combinations, simplifications under spiritual essence and principle of the invention equal
It should be equivalent substitute mode, be included within the scope of the present invention.
Claims (10)
1. a kind of multiple-factor road network method based on crowd-sourced road net data, it is characterised in that: include the following steps,
Step 1, initialization, including two kinds of importings for participating in matched road net data, the setting of matching attribute threshold value and road network number
According to pretreatment；
Step 2, positive match obtain matched reference road, if sought including looping through every road in target data
The candidate matches road for meeting threshold condition is found, matching pair of the highest road of matching degree as target road is therefrom chosen
As；
Step 3, counter-match obtain matched target road, if sought including looping through every road in reference data
The candidate matches road for meeting threshold condition is found, matching pair of the highest road of matching degree as reference road is therefrom chosen
As；
Step 4 carries out deduplication operation to the matching result in step 2 and step 3, gets rid of duplicate path adaptation pair, defeated
The match information of final all matchings pair out.
2. the multiple-factor road network method based on crowd-sourced road net data according to claim 1, it is characterised in that: step 2
The middle matched realization of single road is as follows,
(1) current maximum matching degree is indicated with MaxMatchVal first, initial value is the minimum value DB_ of double types value
Min；
(2) reference road is traversed, judge target road and reference road extends out whether boundary rectangle EMBR intersects, if phase
It hands over, then it is assumed that be the candidate reference road of target road；
(3) the SM_HD distance of target road and candidate reference road is calculated, and obtains matching section；If calculated SM_HD away from
From SM_HD distance threshold DisTol is more than or equal to, then continue to judge next candidate reference road；Conversely, performing the next step；Its
In, SM_HD indicates intermediate value Hausdorff distance；
(4) the deflection difference Angle of the respective matching section of target road and candidate reference road is calculated, if Angle is greater than etc.
In respective direction angular difference value threshold value A ngTol, then continue to judge next candidate reference road；Conversely, performing the next step；
(5) it is buffering radius with SM_HD distance, establishes the buffer area of the respective matching section of target road and candidate reference road, use
The ratio of buffer area intersection area and union area is as the two degree of overlapping；
(6) calculate current candidate matching pair matching degree MatchVal, if matching degree be less than matching degree threshold value MatchTol or
Less than or equal to current maximum matching degree MaxMatchVal, then continue to match next candidate reference road, otherwise will
MatchVal is assigned to MaxMatchVal；
(7) after having matched all reference roads, compare the size of MaxMatchVal and MatchTol.If MaxMatchVal is small
In MatchTol, illustrate then to continue to match next target road not with the matched reference road of the target road；Conversely,
The match information of matching pair is recorded and exported.
3. the multiple-factor road network method based on crowd-sourced road net data according to claim 1, it is characterised in that: step 3
The middle matched realization of single road is as follows,
(1) current maximum matching degree is indicated with MaxMatchVal first, initial value is the minimum value DB_ of double types value
Min；
(2) target road is traversed, judge reference road and target road extends out whether boundary rectangle EMBR intersects, if phase
It hands over, then it is assumed that be the candidate target road of reference road；
(3) the SM_HD distance of reference road and candidate target road is calculated, and obtains matching section；If calculated SM_HD away from
From SM_HD distance threshold DisTol is more than or equal to, then continue to judge next candidate target road；Conversely, performing the next step；Its
In, SM_HD indicates intermediate value Hausdorff distance；
(4) the deflection difference Angle of the respective matching section of reference road and candidate target road is calculated, if Angle is greater than etc.
In respective direction angular difference value threshold value A ngTol, then continue to judge next candidate target road；Conversely, performing the next step；
(5) it is buffering radius with SM_HD distance, establishes the buffer area of the respective matching section of reference road and candidate target road, use
The ratio of buffer area intersection area and union area is as the two degree of overlapping；
(6) calculate current candidate matching pair matching degree MatchVal, if matching degree be less than matching degree threshold value MatchTol or
Less than or equal to current maximum matching degree MaxMatchVal, then continue to match next candidate target road, otherwise will
MatchVal is assigned to MaxMatchVal；
(7) after having matched all target roads, compare the size of MaxMatchVal and MatchTol.If MaxMatchVal is small
In MatchTol, illustrate then to continue to match next reference road not with the matched target road of the reference road；Conversely,
The match information of matching pair is recorded and exported.
4. the according to claim 1 or 2 or 3 multiple-factor road network methods based on crowd-sourced road net data, it is characterised in that:
The pretreatment of the road net data, unification, every road including spatial frame of reference extend out boundary rectangle EMBR calculating and
The increase of road node.
5. the according to claim 1 or 2 or 3 multiple-factor road network methods based on crowd-sourced road net data, it is characterised in that:
Matching degree calculates, and is for measuring the whether matched index of a pair of of road, the calculation formula of matching degree is Wherein, MPCT [i] indicates the matching degree of i-th of matching pair,
SMHD [i] indicates that the intermediate value Hausdorff distance between i-th of matching pair, Angle [i] indicate the angle between i-th of matching pair,
IPCT [i] indicates matching to buffer area degree of overlapping, and ω 1, ω 2, ω 3 are respectively SM_HD distance, matching to road angle and matching
To the preset weights of buffer area degree of overlapping, and ω 1+ ω 2+ ω 3=1.
6. a kind of multiple-factor road network system based on crowd-sourced road net data, it is characterised in that: including following module,
Initialization module, for two kinds of importings for participating in matched road net data, the setting and road net data of matching attribute threshold value
Pretreatment；
Positive match module obtains matched reference road, if searched out for looping through every road in target data
Meet the candidate matches road of threshold condition, therefrom chooses matching object of the highest road of matching degree as target road；
Counter-match module obtains matched target road, if searched out for looping through every road in reference data
Meet the candidate matches road of threshold condition, therefrom chooses matching object of the highest road of matching degree as reference road；
Deduplication module gets rid of repetition for carrying out deduplication operation to the matching result in positive match module and counter-match module
Path adaptation pair, the match information of the final all matchings pair of output.
7. the multiple-factor road network system based on crowd-sourced road net data according to claim 6, it is characterised in that: positive match
The matched realization of single road is as follows in module,
(1) current maximum matching degree is indicated with MaxMatchVal first, initial value is the minimum value DB_ of double types value
Min；
(2) reference road is traversed, judge target road and reference road extends out whether boundary rectangle EMBR intersects, if phase
It hands over, then it is assumed that be the candidate reference road of target road；
(3) the SM_HD distance of target road and candidate reference road is calculated, and obtains matching section；If calculated SM_HD away from
From SM_HD distance threshold DisTol is more than or equal to, then continue to judge next candidate reference road；Conversely, performing the next step；Its
In, SM_HD indicates intermediate value Hausdorff distance；
(4) the deflection difference Angle of the respective matching section of target road and candidate reference road is calculated, if Angle is greater than etc.
In respective direction angular difference value threshold value A ngTol, then continue to judge next candidate reference road；Conversely, performing the next step；
(5) it is buffering radius with SM_HD distance, establishes the buffer area of the respective matching section of target road and candidate reference road, use
The ratio of buffer area intersection area and union area is as the two degree of overlapping；
(6) calculate current candidate matching pair matching degree MatchVal, if matching degree be less than matching degree threshold value MatchTol or
Less than or equal to current maximum matching degree MaxMatchVal, then continue to match next candidate reference road, otherwise will
MatchVal is assigned to MaxMatchVal；
(7) after having matched all reference roads, compare the size of MaxMatchVal and MatchTol.If MaxMatchVal is small
In MatchTol, illustrate then to continue to match next target road not with the matched reference road of the target road；Conversely,
The match information of matching pair is recorded and exported.
8. the multiple-factor road network system based on crowd-sourced road net data according to claim 6, it is characterised in that: counter-match
The matched realization of single road is as follows in module,
(1) current maximum matching degree is indicated with MaxMatchVal first, initial value is the minimum value DB_ of double types value
Min；
(2) target road is traversed, judge reference road and target road extends out whether boundary rectangle EMBR intersects, if phase
It hands over, then it is assumed that be the candidate target road of reference road；
(3) the SM_HD distance of reference road and candidate target road is calculated, and obtains matching section；If calculated SM_HD away from
From SM_HD distance threshold DisTol is more than or equal to, then continue to judge next candidate target road；Conversely, performing the next step；Its
In, SM_HD indicates intermediate value Hausdorff distance；
(4) the deflection difference Angle of the respective matching section of reference road and candidate target road is calculated, if Angle is greater than etc.
In respective direction angular difference value threshold value A ngTol, then continue to judge next candidate target road；Conversely, performing the next step；
(5) it is buffering radius with SM_HD distance, establishes the buffer area of the respective matching section of reference road and candidate target road, use
The ratio of buffer area intersection area and union area is as the two degree of overlapping；
(6) calculate current candidate matching pair matching degree MatchVal, if matching degree be less than matching degree threshold value MatchTol or
Less than or equal to current maximum matching degree MaxMatchVal, then continue to match next candidate target road, otherwise will
MatchVal is assigned to MaxMatchVal；
(7) after having matched all target roads, compare the size of MaxMatchVal and MatchTol.If MaxMatchVal is small
In MatchTol, illustrate then to continue to match next reference road not with the matched target road of the reference road；Conversely,
The match information of matching pair is recorded and exported.
9. according to claim 6 or 7 or the 8 multiple-factor road network systems based on crowd-sourced road net data, it is characterised in that:
The pretreatment of the road net data, unification, every road including spatial frame of reference extend out boundary rectangle EMBR calculating and
The increase of road node.
10. according to claim 6 or 7 or the 8 multiple-factor road network systems based on crowd-sourced road net data, feature exist
In: matching degree calculates, and is for measuring the whether matched index of a pair of of road, the calculation formula of matching degree is Wherein, MPCT [i] indicates i-th
The matching degree of pairing, SMHD [i] indicate that the intermediate value Hausdorff distance between i-th of matching pair, Angle [i] indicate i-th of matching
Angle between pair, IPCT [i] indicate matching to buffer area degree of overlapping, and ω 1, ω 2, ω 3 are respectively SM_HD distance, matching to road
Road angle and matching are to the preset weights of buffer area degree of overlapping, and ω 1+ ω 2+ ω 3=1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811508829.7A CN109657713A (en) | 2018-12-11 | 2018-12-11 | A kind of multiple-factor road network method and system based on crowd-sourced road net data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811508829.7A CN109657713A (en) | 2018-12-11 | 2018-12-11 | A kind of multiple-factor road network method and system based on crowd-sourced road net data |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109657713A true CN109657713A (en) | 2019-04-19 |
Family
ID=66113302
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811508829.7A Pending CN109657713A (en) | 2018-12-11 | 2018-12-11 | A kind of multiple-factor road network method and system based on crowd-sourced road net data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109657713A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110992681A (en) * | 2019-07-10 | 2020-04-10 | 当家移动绿色互联网技术集团有限公司 | Traffic network attribute information generation method, device, storage medium and electronic equipment |
| CN112577498A (en) * | 2019-09-30 | 2021-03-30 | 阿里巴巴集团控股有限公司 | Road data updating method and device, electronic equipment and storage medium |
| CN112766385A (en) * | 2021-01-22 | 2021-05-07 | 武汉大学 | Many-source vector line data geometric matching and attribute fusion method |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070185946A1 (en) * | 2004-02-17 | 2007-08-09 | Ronen Basri | Method and apparatus for matching portions of input images |
| CN106023587A (en) * | 2016-05-25 | 2016-10-12 | 电子科技大学 | Track data road network precise matching method based on multi-information fusion |
| CN106649466A (en) * | 2016-09-27 | 2017-05-10 | 西安电子科技大学 | Method for obtaining geometrical parameters of typical terrains in digital map |
| CN106780525A (en) * | 2016-11-18 | 2017-05-31 | 北方工业大学 | Optical remote sensing image ship direction feature extraction method based on coordinate rotation minimum circumscribed rectangle |
| CN107885790A (en) * | 2017-10-19 | 2018-04-06 | 东南大学 | A kind of path space network multiple-factor automatic update method |
| CN108253974A (en) * | 2017-12-29 | 2018-07-06 | 深圳市城市交通规划设计研究中心有限公司 | Floating Car location data automatic adaptation cushion route matching system and method |
| CN108680165A (en) * | 2018-05-04 | 2018-10-19 | 中国人民解放军63920部队 | Target aircraft attitude determination method based on optical imagery and device |
-
2018
- 2018-12-11 CN CN201811508829.7A patent/CN109657713A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070185946A1 (en) * | 2004-02-17 | 2007-08-09 | Ronen Basri | Method and apparatus for matching portions of input images |
| CN106023587A (en) * | 2016-05-25 | 2016-10-12 | 电子科技大学 | Track data road network precise matching method based on multi-information fusion |
| CN106649466A (en) * | 2016-09-27 | 2017-05-10 | 西安电子科技大学 | Method for obtaining geometrical parameters of typical terrains in digital map |
| CN106780525A (en) * | 2016-11-18 | 2017-05-31 | 北方工业大学 | Optical remote sensing image ship direction feature extraction method based on coordinate rotation minimum circumscribed rectangle |
| CN107885790A (en) * | 2017-10-19 | 2018-04-06 | 东南大学 | A kind of path space network multiple-factor automatic update method |
| CN108253974A (en) * | 2017-12-29 | 2018-07-06 | 深圳市城市交通规划设计研究中心有限公司 | Floating Car location data automatic adaptation cushion route matching system and method |
| CN108680165A (en) * | 2018-05-04 | 2018-10-19 | 中国人民解放军63920部队 | Target aircraft attitude determination method based on optical imagery and device |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110992681A (en) * | 2019-07-10 | 2020-04-10 | 当家移动绿色互联网技术集团有限公司 | Traffic network attribute information generation method, device, storage medium and electronic equipment |
| CN110992681B (en) * | 2019-07-10 | 2021-06-11 | 北京五一视界数字孪生科技股份有限公司 | Traffic network attribute information generation method, device, storage medium and electronic equipment |
| CN112577498A (en) * | 2019-09-30 | 2021-03-30 | 阿里巴巴集团控股有限公司 | Road data updating method and device, electronic equipment and storage medium |
| CN112766385A (en) * | 2021-01-22 | 2021-05-07 | 武汉大学 | Many-source vector line data geometric matching and attribute fusion method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107766808B (en) | Method and system for clustering moving tracks of vehicle objects in road network space | |
| CN106323301B (en) | Method and device for acquiring road information | |
| CN109657713A (en) | A kind of multiple-factor road network method and system based on crowd-sourced road net data | |
| CN105787937B (en) | A kind of high resolution remote sensing image road change detecting method based on OSM | |
| CN103512581B (en) | A kind of paths planning method and device | |
| CN109447160A (en) | A kind of method of image and vector road junction Auto-matching | |
| CN109143291A (en) | A kind of vehicle GPS trajectory range index fine matching method | |
| CN109813327B (en) | Vehicle running track loss compensation method | |
| Li et al. | Knowledge-based trajectory completion from sparse GPS samples | |
| CN108520114A (en) | A kind of textile cloth defect detection model and its training method and application | |
| CN103823951B (en) | Method for quantifying characteristics of road network and effect of characteristics of road network on land utilization | |
| CN102200446B (en) | Continuous path detection device and method based on traffic data | |
| CN109947881B (en) | POI weight judging method and device, mobile terminal and computer readable storage medium | |
| CN111445320B (en) | Target community identification method and device, computer equipment and storage medium | |
| CN106548510A (en) | Shield tunnel construction model generation method | |
| CN103823914A (en) | Touring line planning method | |
| Chao et al. | A survey and quantitative study on map inference algorithms from gps trajectories | |
| CN110782178A (en) | Traffic network planning aid decision-making method and device | |
| Krüger et al. | Visual interactive map matching | |
| Zhang et al. | A turning point-based offline map matching algorithm for urban road networks | |
| CN106203278B (en) | The method and device of two-track road on a kind of extraction map | |
| CN112766718A (en) | City business district boundary identification method, system, computer equipment and storage medium | |
| KR101063827B1 (en) | Semi-automated Conjugated Point Pair Extraction Method for Transformation of Geometric Maps between Continuous and Digital Topographic Maps | |
| Guo et al. | A scalable method to construct compact road networks from GPS trajectories | |
| CN116087198B (en) | Highway road surface situation data acquisition equipment and automatic rapid detection system thereof |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190419 |
|
| RJ01 | Rejection of invention patent application after publication |