CN105868553A - Track data processing method - Google Patents

Track data processing method Download PDF

Info

Publication number
CN105868553A
CN105868553A CN201610184204.4A CN201610184204A CN105868553A CN 105868553 A CN105868553 A CN 105868553A CN 201610184204 A CN201610184204 A CN 201610184204A CN 105868553 A CN105868553 A CN 105868553A
Authority
CN
China
Prior art keywords
point
vector
matching vector
matching
tracing
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.)
Granted
Application number
CN201610184204.4A
Other languages
Chinese (zh)
Other versions
CN105868553B (en
Inventor
林学练
张瀚
左萌
左一萌
沃天宇
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beihang University
Original Assignee
Beihang University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beihang University filed Critical Beihang University
Priority to CN201610184204.4A priority Critical patent/CN105868553B/en
Publication of CN105868553A publication Critical patent/CN105868553A/en
Application granted granted Critical
Publication of CN105868553B publication Critical patent/CN105868553B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G16INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
    • G16ZINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS, NOT OTHERWISE PROVIDED FOR
    • G16Z99/00Subject matter not provided for in other main groups of this subclass

Landscapes

  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

The invention discloses a track data processing method. The method comprises the steps of obtaining positions from a starting track point Ps to a <i>th track point Pi and a fitting vector Ri-1' of an <i-1> track segment formed by all track points between the starting track point Ps and an <i-1>th track point Pi-1', wherein i is an integer which is greater than or equal to 1 and smaller than or equal to N, and N represents the number of all the track points; according to the position of the starting track point Ps and the position of the <i>th track point Pi, obtaining an original vector Ri formed by Pi and Ps, and according to the fitting vector Ri-1'and the original vector Ri, conducting calculation and obtaining a fitting vector Ri'; when i equals to N, outputting the fitting vector Ri', so that a compression track segment corresponding to an <N>th track segment formed by all the track points between the starting track point and an <N>th track point is obtained. By means of the track data processing method, data compression efficiency is improved.

Description

Track data processing method
Technical field
The present invention relates to data processing field, particularly relate to a kind of for track data processing method.
Background technology
In recent years, along with popularizing of mobile device, the various application programs with positioning function obtain extensively Use, produce substantial amounts of track data therewith.Such as when vehicle runs, mobile unit, such as, the whole world Alignment system with the data of certain frequency (such as 5 seconds) each tracing point of collection vehicle, including longitude, The information such as latitude, acquisition time, vehicle current driving direction.Track data typically requires uploads high in the clouds, For subsequent analysis, process and service.When mobile device uploads initial trace point data, factor data amount Greatly, memory space and Internet resources are wasted.It is thus desirable to track data is compressed.
In prior art, a kind of conventional track data processing method is to use polyline compression method pair Initial trace data are compressed, and the way of existing polyline compression method is: often gather a rail The data of mark point, in the track line segment gathered, are compressed meter before just being added by newly-increased tracing point During calculation, all tracing points in tracking trace segments are compressed calculating.
But, use polyline compression method of the prior art, often increasing a tracing point will be right All tracing points in track line segment calculate before, i.e. the tracing point relatively early gathered can be through repeatedly Calculating, it is higher that this makes to calculate process complexity, causes efficiency of data compression low, wastes resource.
Summary of the invention
The embodiment of the present invention provides a kind of track data processing method, is used for solving track of the prior art During data processing method calculates, complexity is higher, the problem that efficiency of data compression is low.
Embodiment of the present invention track data processing method, including:
Obtain start track point PsAnd i-th tracing point PiPosition, and described start track point PsExtremely The i-th-1 tracing point Pi-1Between the matching vector of the i-th-1 track line segment that formed of all tracing points Ri-1', described matching vector Ri-1' represent the compression that described the i-th-1 track line segment obtains after compression Track line segment;I is the integer more than or equal to 1 and less than or equal to N, and N represents the quantity of all tracing points;
According to described start track point PsAnd described i-th tracing point PiPosition, obtain described PiWith institute State PsThe original vector R formedi, and according to matching vector Ri-1' and described original vector Ri, calculate To matching vector Ri', described matching vector Ri' represent described PsBetween described i-th tracing point The matching vector of i-th track line segment that all tracing points are formed, the most described i-th track line segment is through pressure The compressed tracks trace segments obtained after contracting;
As i=N, export described matching vector Ri', obtain described start track point to described n-th The compressed tracks trace segments that the N article track line segment that all tracing points between tracing point are formed is corresponding.
In another embodiment, described method also includes:
Calculate i-th tracing point PiTo described matching vector Ri-1Distance d between 'i
Judge described diWhether more than predetermined threshold value δ;
If described diMore than or equal to described predetermined threshold value δ, export described Ri-1', determine new initiateing Tracing point PS is new
The most described according to described start track point PsAnd described i-th tracing point PiPosition, obtain described PiWith described PsThe described original vector R formedi, and according to matching vector Ri-1' and described original vector Ri, it is calculated described matching vector Ri', including:
According to described new start track point PS is newAnd described i-th tracing point PiPosition, obtain described I tracing point PiWith described start track point PS is newThe described original vector R formedi, and according to described matching Vector Ri-1' and described original vector Ri, it is calculated described matching vector Ri’。
In another embodiment, described determine new start track point PS is new, including:
By described matching vector Ri-1' terminal Pi-1' or the i-th-1 tracing point Pi-1Be set to described newly Start track point PS is new
The most described according to described new start track point PS is newAnd described i-th tracing point PiPosition, obtain Described i-th tracing point PiWith described new start track point PS is newThe original vector R formedi, and according to Described matching vector Ri-1' and described original vector Ri, it is calculated matching vector Ri', including:
According to described matching vector Ri-1' terminal Pi-1' and described i-th tracing point PiPosition, To described matching vector Ri’;
Or,
According to the i-th-1 tracing point Pi-1With described i-th tracing point PiPosition, obtain described i-th Tracing point PiWith described the i-th-1 tracing point Pi-1The original vector R formedi;And according to described matching vector Ri-1' and described original vector Ri, it is calculated described matching vector Ri’。
In another embodiment, described determine new start track point PS is new, including:
By described i-th tracing point PiIt is set to described new start track point PS is new
In another embodiment, described method also includes:
Obtain the first matching vector R that the nth bar compressed tracks trace segments of output is correspondingn' and (n+1)th pressure The second matching vector R that contracting track line segment is correspondingn+1', described first matching vector Rn' with described second Matching vector Rn+1' adjacent;Described first matching vector Rn' by the first starting point Pns' and First terminal point Pne' constitute, described second matching vector Rn+1' by the second starting point P(n+1)s' and the second terminal P(n+1)e’ Constitute;N is the integer more than or equal to 1 and less than or equal to N;
If described First terminal point Pne' extremely described second matching vector Rn+1' distance less than predetermined threshold value δ, then according to described First terminal point Pne' at described second matching vector Rn+1Subpoint P on 'x', And described second final on trajectory P(n+1)e' form original vector Rm
Export described first matching vector RnAnd described original vector Rm
In another embodiment, described method also includes:
Obtain the first matching vector R that the nth bar compressed tracks trace segments of output is correspondingn' and (n+1)th pressure The second matching vector R that contracting track line segment is correspondingn+1', described first matching vector Rn' with described second Matching vector Rn+1' adjacent;Described first matching vector Rn' by the first starting point Pns' and First terminal point Pne' constitute, described second matching vector Rn+1' by the second starting point P(n+1)s' and the second terminal P(n+1)e’ Constitute;N is the integer more than or equal to 1 and less than or equal to N;
If described First terminal point Pne' extremely described second matching vector Rn+1' distance more than described default threshold Value δ, described first matching vector Rn' and described second matching vector Rn+1' extension line intersect at friendship Point Px', and meet γ1> 0 and γ2> 0, or γ1< 0 and γ2< 0, and described first matching vector Rn’ With described second matching vector Rn+1' angle γ3Meet | γ3| less than or equal to presetting angle value γm, then basis Described first starting point Pns' and described intersection point Px' form original vector Ra;According to described intersection point Px' and Described second terminal P(n+1)e' form original vector Rb
Wherein, γ1Represent described first matching vector Rn' extended line and line segment Pne’P(n+1)s' folder Angle, described line segment Pne’P(n+1)s' represent described First terminal point Pne' and described second terminal P(n+1)s’ The line segment formed;
γ2Represent described second matching vector Rn+1' extended line and described line segment Pne’P(n+1)s' folder Angle;
γ3Represent described first matching vector Rn' extended line and described second matching vector Rn+1' The angle of extended line;
γmRepresent described line segment Pne’P(n+1)s' and described second matching vector Rn+1' the most described One matching vector Rn' angle threshold that deflects, described γmBoundary is between (pi/2, π);
Export described original vector RaAnd Rb
In another embodiment, described according to described matching vector Ri-1' and described original vector Ri, calculate Obtain matching vector Ri', including:
According to
θ’i=θ 'i-1+asin(di/ri)/i
Calculate described matching vector Ri' angle, θ 'i, wherein, riRepresent described;
According to ri'=riDetermine described matching vector Ri' length ri', wherein, riRepresent described initial rail Distance between mark point Ps and described i-th point.
In another embodiment, described according to described matching vector Ri-1' and described original vector Ri, calculate Obtain matching vector Ri', including:
If ri-ri-1< δ,
Then basis
θ’i=θ 'i-1+asin(di/ri)/m
Calculate described matching vector Ri' angle, θ 'i, wherein, m=ri/ δ, riRepresent described i-th rail Mark point is to described start track point PsDistance, ri-1Represent that described the i-th-1 tracing point is to described initial rail Mark point PsDistance;
According to ri'=riDetermine described matching vector Ri' length ri’。
In another embodiment, described according to described matching vector Ri-1' and described original vector Ri, calculate Obtain matching vector Ri', including:
According to
θ’i=θ 'i-1+asin(di/ri)/(i* (1+logi)),
Calculate described matching vector Ri' angle, θ 'i
Wherein, riRepresent described i-th tracing point PiTo described start track point PsDistance;
According to ri'=riDetermine described matching vector Ri' length ri’。
In another embodiment, described according to described matching vector Ri-1' and described original vector Ri, calculate Obtain matching vector Ri', including:
According to
θ’i=θ 'i-1+asin(di/ri)/(m*(1+logm))
Calculate described matching vector Ri' angle, θ 'i
Wherein, riRepresent that described i-th tracing point is to described start track point PsDistance;M=ri/δ;
According to ri'=riDetermine described matching vector Ri' length ri’.The track data that the present invention provides Processing method, by start track point PsAnd i-th tracing point PiPosition, obtain described PiWith described PsThe described vector R formedi, and according to Ri-1' and described Ri, it is calculated Ri', described Ri-1' table Show described PsThe matching vector of the track line segment that all tracing points between the i-th-1 tracing point are formed. Use the embodiment of the present invention to provide track data processing method, carry out for each newly-increased tracing point data During compression, it is only necessary to get what all tracing points between previous tracing point and start track point were formed The matching vector R of track line segmenti-1', at Ri-1On the basis of ', according to newly-increased tracing point and track primary The vector that mark point is formed, i.e. can obtain all track point-shaped between tracing point and the start track point increased newly The track line segment after overcompression become, newly-increased tracing point only need to be processed by the process that compression calculates, All tracing points in path segment have only to process once, greatly reduce computation complexity, improve Efficiency of data compression.
Accompanying drawing explanation
In order to be illustrated more clearly that the embodiment of the present invention or technical scheme of the prior art, below will be to reality The accompanying drawing used required for executing in example or description of the prior art does one and introduces simply, it should be apparent that, Accompanying drawing in describing below is some embodiments of the present invention, comes for those of ordinary skill in the art Say, on the premise of not paying creative work, it is also possible to obtain the attached of other according to these accompanying drawings Figure.
Fig. 1 is the flow chart of embodiment of the present invention track data processing method;
Fig. 2 is for using Ri-1' terminal Pi-1' as start track point PsReconfigure new matching vector Ri' schematic diagram of two compressed tracks trace segments that obtains;
Fig. 3 is for using i-th tracing point PiAs start track point PsReconfigure new matching vector Ri’ The schematic diagram of two the compressed tracks trace segments obtained;
Fig. 4 is the signal that discrete compressed tracks trace segments is repaired the first embodiment obtained Figure;
Fig. 5 is the signal that discrete compressed tracks trace segments is repaired the second embodiment obtained Figure.
Detailed description of the invention
For making the purpose of the embodiment of the present invention, technical scheme and advantage clearer, below in conjunction with this Accompanying drawing in bright embodiment, is clearly and completely described the technical scheme in the embodiment of the present invention, Obviously, described embodiment is a part of embodiment of the present invention rather than whole embodiments.Based on Embodiment in the present invention, those of ordinary skill in the art are obtained under not making creative work premise The every other embodiment obtained, broadly falls into the scope of protection of the invention.
Embodiment of the present invention track data processing method is carried out for the track data collecting mobile terminal Compression.Such as, gather automobile track data in the process of moving and be compressed.
Fig. 1 is the flow chart of embodiment of the present invention track data processing method.
Referring to Fig. 1, the track data processing method that the embodiment of the present invention provides includes:
S101: obtain start track point PsAnd i-th tracing point PiPosition, and described start track Point PsTo the i-th-1 tracing point Pi-1Between the matching of the i-th-1 track line segment that formed of all tracing points Vector Ri-1', described matching vector Ri-1' represent that described the i-th-1 track line segment obtains after compression Compressed tracks trace segments;I is the integer more than or equal to 1 and less than or equal to N, and N represents all tracing points Quantity;
Specifically, as i=1, according to start track point PsAnd with the 1st tracing point PiPosition, To described P1With described PsThe initialization vector R formed1, and described PsWith described PiThe trajectory formed The matching vector R of section1', for the input initial value as subsequent step.
S102: according to described start track point PsAnd described i-th tracing point PiPosition, obtain described PiWith described PsThe original vector R formedi, and according to matching vector Ri-1' and described original vector Ri, It is calculated matching vector Ri', described matching vector Ri' represent described PsTo described i-th tracing point Between the matching vector of i-th track line segment that formed of all tracing points, the most described i-th track line segment The compressed tracks trace segments obtained after overcompression;
Repeat above-mentioned steps S102, until during i=N, obtaining described start track point PsWith described N number of tracing point PNMatching vector RN’。
S103: as i=N, exports described matching vector Ri', obtain described start track point to described The compressed tracks trace that the N article track line segment that all tracing points between n-th tracing point are formed is corresponding Section.
As i=N, stop calculating described Ri', i.e. all N number of tracing points are completed compression and calculates, The described R obtained eventuallyN' i.e. represent described start track point PsThe rail formed to described n-th tracing point Trace segments track line segment after overcompression.Export described RN', i.e. complete the compression of described track line segment.
Embodiment of the present invention track data processing method, by start track point PsAnd i-th tracing point Pi Position, obtain described PiWith described PsThe described vector R formedi, and according to Ri-1' and described Ri, It is calculated Ri', described Ri-1' represent described PsAll track point-shaped between the i-th-1 tracing point The matching vector of the track line segment become.The embodiment of the present invention is used to provide track data processing method, for When each newly-increased tracing point data are compressed, it is only necessary to get previous tracing point and start track The matching vector R of the track line segment that all tracing points between point are formedi-1', at Ri-1On the basis of ', The vector formed with initial track point according to newly-increased tracing point, the tracing point that i.e. can obtain increasing newly is with initial The track line segment after overcompression that all tracing points between tracing point are formed, the process that compression calculates is only Need to process newly-increased tracing point, all tracing points in path segment have only to process once, greatly Reduce greatly computation complexity, improve efficiency of data compression.
In order to reduce the error during compression calculates, further, embodiment of the present invention data process side Method, also includes:
Calculate i-th tracing point PiTo described matching vector Ri-1Distance d between 'i
Judge described diWhether more than predetermined threshold value δ;
If described diMore than or equal to described predetermined threshold value δ, export described Ri-1', determine new initiateing Tracing point PS is new
The most described according to described start track point PsAnd described i-th tracing point PiPosition, obtain described PiWith described PsThe described original vector R formedi, and according to matching vector Ri-1' and described original vector Ri, it is calculated described matching vector Ri', including:
According to described new start track point PS is newAnd described i-th tracing point PiPosition, obtain described I tracing point PiWith described start track point PS is newThe described original vector R formedi, and according to described matching Vector Ri-1' and described original vector Ri, it is calculated described matching vector Ri’。
Wherein, described predetermined threshold value δ is used for representing compressed error, works as diMore than or equal to described default threshold During value δ, illustrate that the error of compression process reaches the upper limit, need to be modified.Now, output is described Ri-1', and according to new start track point PsReconfigure described Ri’。
Further, in order to prevent vehicle from occurring during turning around, running data is lost, and the present invention implements Example data processing method, also includes:
Determine described matching vector Ri-1' length r 'n-1With described original vector RiLength ri, when ri-r’i-1During <-δ, redefine described start track point Ps
Specifically, in the first implementation, described determine new start track point PS is new, including:
By described matching vector Ri-1' terminal Pi-1' or the i-th-1 tracing point Pi-1Be set to described newly Start track point PS is new
The most described according to described new start track point PS is newAnd described i-th tracing point PiPosition, obtain Described i-th tracing point PiWith described new start track point PS is newThe original vector R formedi, and according to Described matching vector Ri-1' and described original vector Ri, it is calculated matching vector Ri', including:
According to described matching vector Ri-1' terminal Pi-1' and described i-th tracing point PiPosition, To described matching vector Ri’;
Or,
According to the i-th-1 tracing point Pi-1With described i-th tracing point PiPosition, obtain described i-th Tracing point PiWith described the i-th-1 tracing point Pi-1The original vector R formedi;And according to described matching vector Ri-1' and described original vector Ri, it is calculated described matching vector Ri’。
Fig. 2 is for using Ri-1' terminal Pi-1' as start track point PsReconfigure new matching vector Ri' schematic diagram of two compressed tracks trace segments that obtains.
Refer to Fig. 2, when using Ri-1' terminal Pi-1' as start track point PsReconfigure matching Vector Ri' time, the new compressed tracks trace segments obtained is the first being connected with compressed tracks trace segments before Line segment continuously.
In the second implementation, in order to improve the compression ratio of track line segment, described determine new initial Tracing point PS is new, including:
By described i-th tracing point PiIt is set to described new start track point Ps
Fig. 3 is for using i-th tracing point PiAs start track point PsReconfigure new matching vector Ri’ The schematic diagram of two the compressed tracks trace segments obtained.
Refer to Fig. 3, when using i-th tracing point PiAs start track point PsReconfigure matching to vow Amount Ri' time, the new compressed tracks trace segments obtained is non-continuous line segment with compressed tracks trace segments before. In order to obtain continuous print compressed tracks trace segments, need described discontinuous line segment is repaired.
Fig. 4 is, according to the first embodiment, discrete compressed tracks trace segments is repaired the rail obtained The schematic diagram of trace segments.
Referring to Fig. 4, in order to repair described discontinuous line segment, described method also includes:
Obtain the first matching vector R that the nth bar compressed tracks trace segments of output is correspondingn' and (n+1)th pressure The second matching vector R that contracting track line segment is correspondingn+1', described first matching vector Rn' with described second Matching vector Rn+1' adjacent;Described first matching vector Rn' by the first starting point Pns' and First terminal point Pne' constitute, described second matching vector Rn+1' by the second starting point P(n+1)s' and the second terminal P(n+1)e’ Constitute;N is the integer more than or equal to 1 and less than or equal to N;
If described First terminal point Pne' extremely described second matching vector Rn+1' distance less than predetermined threshold value δ, then according to described First terminal point Pne' at described second matching vector Rn+1Subpoint P on 'x', And described second final on trajectory P(n+1)e' form original vector Rm
Export described first matching vector RnAnd described original vector Rm
Fig. 5 is, according to the second embodiment, discrete compressed tracks trace segments is repaired the rail obtained The schematic diagram of trace segments.
Referring to Fig. 5, in order to repair described discontinuous line segment, described method also includes:
Obtain the first matching vector R that the nth bar compressed tracks trace segments of output is correspondingn' and (n+1)th pressure The second matching vector R that contracting track line segment is correspondingn+1', described first matching vector Rn' with described second Matching vector Rn+1' adjacent;Described first matching vector Rn' by the first starting point Pns' and First terminal point Pne' constitute, described second matching vector Rn+1' by the second starting point P(n+1)s' and the second terminal P(n+1)e’ Constitute;N is the integer more than or equal to 1 and less than or equal to N;
If described First terminal point Pne' extremely described second matching vector Rn+1' distance more than described default threshold Value δ, described first matching vector Rn' and described second matching vector Rn+1' extension line intersect at friendship Point Px', and meet γ1> 0 and γ2> 0, or γ1< 0 and γ2< 0, and described first matching vector Rn’ With described second matching vector Rn+1' angle γ3Meet | γ3| less than or equal to presetting angle value γm, then basis Described first starting point Pns' and described intersection point Px' form original vector Ra;According to described intersection point Px' and Described second terminal P(n+1)e' form original vector Rb
Wherein, γ1Represent described first matching vector Rn' extended line and line segment Pne’P(n+1)s' folder Angle, described line segment Pne’P(n+1)s' represent described First terminal point Pne' and described second terminal P(n+1)s’ The line segment formed;
γ2Represent described second matching vector Rn+1' extended line and described line segment Pne’P(n+1)s' folder Angle;
γ3Represent described first matching vector Rn' extended line and described second matching vector Rn+1' The angle of extended line;
γmRepresent described line segment Pne’P(n+1)s' and described second matching vector Rn+1' the most described One matching vector Rn' angle threshold that deflects, described γmBoundary is between (pi/2, π);
Export described original vector RaAnd Rb
Remove the situation in both the above embodiment, when discrete compressed tracks trace segments is repaired, Directly export described first matching vector Rn', described second matching vector Rn+1', and described first end Point Pne' and described second starting point P(n+1)s' original vector that formed.
On the basis of above-described embodiment, specifically, described according to described matching vector Ri-1' and described former Beginning vector Ri, it is calculated matching vector Ri', including:
According to
θ’i=θ 'i-1+asin(di/ri)/i
Calculate described matching vector Ri' angle, θ 'i, wherein, riRepresent described;
According to ri'=riDetermine described matching vector Ri' length ri', wherein, riRepresent described initial rail Distance between mark point Ps and described i-th point.
In order to improve the efficiency of compression process further, it is to avoid be compressed invalid tracing point calculating, Described according to described matching vector Ri-1' and described original vector Ri, it is calculated matching vector Ri', Including:
If ri-ri-1< δ,
Then basis
θ’i=θ 'i-1+asin(di/ri)/m
Calculate described matching vector Ri' angle, θ 'i, wherein, m=ri/ δ, riRepresent described i-th rail Mark point is to described start track point PsDistance, ri-1Represent that described the i-th-1 tracing point is to described initial rail Mark point PsDistance;
According to ri'=riDetermine described matching vector Ri' length ri’。
Specifically, if described the i-th-1 tracing point PsIt is available point, works as ri-ri-1During >=δ, described i-th Individual tracing point is also available point, and otherwise, described i-th tracing point is Null Spot.For available point i, i.e. Described R can be calculated according to formula (2)i' angle, θ 'i.For Null Spot, it is not involved in θ 'iCalculating.
In order to improve the compression degree of accuracy of tracking trace segments further, reduce the upper limit of maximum error, described According to described matching vector Ri-1' and described original vector Ri, it is calculated matching vector Ri', including:
According to
θ’i=θ 'i-1+asin(di/ri)/(i* (1+logi)),
Calculate described matching vector Ri' angle, θ 'i
Wherein, riRepresent described i-th tracing point PiTo described start track point PsDistance;
According to ri'=riDetermine described matching vector Ri' length ri’。
Alternatively, in order to improve the compression degree of accuracy of tracking trace segments further, reduce the upper of maximum error Limit, in another embodiment, described according to described matching vector Ri-1' and described original vector Ri, It is calculated matching vector Ri', including:
According to
θ’i=θ 'i-1+asin(di/ri)/(m*(1+logm))
Calculate described matching vector Ri' angle, θ 'i
Wherein, riRepresent that described i-th tracing point is to described start track point PsDistance;M=ri/δ;
According to ri'=riDetermine described matching vector Ri' length ri’。
One of ordinary skill in the art will appreciate that: realize all or part of step of above-mentioned each method embodiment Suddenly can be completed by the hardware that programmed instruction is relevant.Aforesaid program can be stored in a computer, In the read/write memory medium of mobile phone or other portable units.Upon execution, execution includes above-mentioned this program The step of each method embodiment;And aforesaid storage medium includes: ROM, RAM, magnetic disc or CD Etc. the various media that can store program code.
Last it is noted that various embodiments above is only in order to illustrate technical scheme, rather than right It limits;Although the present invention being described in detail with reference to foregoing embodiments, this area common Skilled artisans appreciate that the technical scheme described in foregoing embodiments still can be modified by it, Or the most some or all of technical characteristic is carried out equivalent;And these amendments or replacement, and The essence not making appropriate technical solution departs from the scope of various embodiments of the present invention technical scheme.

Claims (10)

1. a track data processing method, it is characterised in that including:
Obtain start track point PsAnd i-th tracing point PiPosition, and described start track point PsExtremely The i-th-1 tracing point Pi-1Between the matching vector of the i-th-1 track line segment that formed of all tracing points Ri-1', described matching vector Ri-1' represent the compression that described the i-th-1 track line segment obtains after compression Track line segment;I is the integer more than or equal to 1 and less than or equal to N, and N represents the quantity of all tracing points;
According to described start track point PsAnd described i-th tracing point PiPosition, obtain described PiWith institute State PsThe original vector R formedi, and according to matching vector Ri-1' and described original vector Ri, calculate To matching vector Ri', described matching vector Ri' represent described PsBetween described i-th tracing point The matching vector of i-th track line segment that all tracing points are formed, the most described i-th track line segment is through pressure The compressed tracks trace segments obtained after contracting;
As i=N, export described matching vector Ri', obtain described start track point to described n-th The compressed tracks trace segments that the N article track line segment that all tracing points between tracing point are formed is corresponding.
Method the most according to claim 1, it is characterised in that also include:
Calculate i-th tracing point PiTo described matching vector Ri-1Distance d between 'i
Judge described diWhether more than predetermined threshold value δ;
If described diMore than or equal to described predetermined threshold value δ, export described Ri-1', determine new initiateing Tracing point PS is new
The most described according to described start track point PsAnd described i-th tracing point PiPosition, obtain described PiWith described PsThe described original vector R formedi, and according to matching vector Ri-1' and described original vector Ri, it is calculated described matching vector Ri', including:
According to described new start track point PS is newAnd described i-th tracing point PiPosition, obtain described I tracing point PiWith described start track point PS is newThe described original vector R formedi, and according to described matching Vector Ri-1' and described original vector Ri, it is calculated described matching vector Ri’。
Method the most according to claim 2, it is characterised in that described determine new start track point PS is new, including:
By described matching vector Ri-1' terminal Pi-1' or the i-th-1 tracing point Pi-1Be set to described newly Start track point PS is new
The most described according to described new start track point PS is newAnd described i-th tracing point PiPosition, obtain Described i-th tracing point PiWith described new start track point PS is newThe original vector R formedi, and according to Described matching vector Ri-1' and described original vector Ri, it is calculated matching vector Ri', including:
According to described matching vector Ri-1' terminal Pi-1' and described i-th tracing point PiPosition, To described matching vector Ri’;
Or,
According to the i-th-1 tracing point Pi-1With described i-th tracing point PiPosition, obtain described i-th Tracing point PiWith described the i-th-1 tracing point Pi-1The original vector R formedi;And according to described matching vector Ri-1' and described original vector Ri, it is calculated described matching vector Ri’。
Method the most according to claim 2, it is characterised in that described determine new start track point PS is new, including:
By described i-th tracing point PiIt is set to described new start track point PS is new
Method the most according to claim 4, it is characterised in that also include:
Obtain the first matching vector R that the nth bar compressed tracks trace segments of output is correspondingn' and (n+1)th pressure The second matching vector R that contracting track line segment is correspondingn+1', described first matching vector Rn' with described second Matching vector Rn+1' adjacent;Described first matching vector Rn' by the first starting point Pns' and First terminal point Pne' constitute, described second matching vector Rn+1' by the second starting point P(n+1)s' and the second terminal P(n+1)e’ Constitute;N is the integer more than or equal to 1 and less than or equal to N;
If described First terminal point Pne' extremely described second matching vector Rn+1' distance less than predetermined threshold value δ, then according to described First terminal point Pne' at described second matching vector Rn+1Subpoint P on 'x', And described second final on trajectory P(n+1)e' form original vector Rm
Export described first matching vector RnAnd described original vector Rm
Method the most according to claim 4, it is characterised in that also include:
Obtain the first matching vector R that the nth bar compressed tracks trace segments of output is correspondingn' and (n+1)th pressure The second matching vector R that contracting track line segment is correspondingn+1', described first matching vector Rn' with described second Matching vector Rn+1' adjacent;Described first matching vector Rn' by the first starting point Pns' and First terminal point Pne' constitute, described second matching vector Rn+1' by the second starting point P(n+1)s' and the second terminal P(n+1)e’ Constitute;N is the integer more than or equal to 1 and less than or equal to N;
If described First terminal point Pne' extremely described second matching vector Rn+1' distance more than described default threshold Value δ, described first matching vector Rn' and described second matching vector Rn+1' extension line intersect at friendship Point Px', and meet γ1> 0 and γ2> 0, or γ1< 0 and γ2< 0, and described first matching vector Rn’ With described second matching vector Rn+1' angle γ3Meet | γ3| less than or equal to presetting angle value γm, then basis Described first starting point Pns' and described intersection point Px' form original vector Ra;According to described intersection point Px' and Described second terminal P(n+1)e' form original vector Rb
Wherein, γ1Represent described first matching vector Rn' extended line and line segment Pne’P(n+1)s' folder Angle, described line segment Pne’P(n+1)s' represent described First terminal point Pne' and described second terminal P(n+1)s’ The line segment formed;
γ2Represent described second matching vector Rn+1' extended line and described line segment Pne’P(n+1)s' folder Angle;
γ3Represent described first matching vector Rn' extended line and described second matching vector Rn+1' The angle of extended line;
γmRepresent described line segment Pne’P(n+1)s' and described second matching vector Rn+1' the most described One matching vector Rn' angle threshold that deflects, described γmBoundary is between (pi/2, π);
Export described original vector RaAnd Rb
7. according to the method described in any one of claim 1-6, it is characterised in that described according to described plan Resultant vector Ri-1' and described original vector Ri, it is calculated matching vector Ri', including:
According to
θ’i=θ 'i-1+asin(di/ri)/i
Calculate described matching vector Ri' angle, θ i, wherein, riRepresent described;
According to ri'=riDetermine described matching vector Ri' length ri', wherein, riRepresent described initial rail Distance between mark point Ps and described i-th point.
8. according to the method described in any one of claim 1-6, it is characterised in that described according to described plan Resultant vector Ri-1' and described original vector Ri, it is calculated matching vector Ri', including:
If ri-ri-1< δ,
Then basis
θ’i=θ 'i-1+asin(di/ri)/m
Calculate described matching vector Ri' angle, θ 'i, wherein, m=ri/ δ, riRepresent described i-th rail Mark point is to described start track point PsDistance, ri-1Represent that described the i-th-1 tracing point is to described initial rail Mark point PsDistance;
According to ri'=riDetermine described matching vector Ri' length ri’。
9. according to the method described in any one of claim 1-6, it is characterised in that described according to described plan Resultant vector Ri-1' and described original vector Ri, it is calculated matching vector Ri', including:
According to
θ’i=θ 'i-1+asin(di/ri)/(i* (1+logi)),
Calculate described matching vector Ri' angle, θ 'i
Wherein, riRepresent described i-th tracing point PiTo described start track point PsDistance;
According to ri'=riDetermine described matching vector Ri' length ri’。
10. according to the method described in any one of claim 1-6, it is characterised in that described in described basis Matching vector Ri-1' and described original vector Ri, it is calculated matching vector Ri', including:
According to
θ’i=θ 'i-1+asin(di/ri)/(m*(1+logm))
Calculate described matching vector Ri' angle, θ 'i
Wherein, riRepresent that described i-th tracing point is to described start track point PsDistance;M=ri/δ;
According to ri'=riDetermine described matching vector Ri' length ri’。
CN201610184204.4A 2016-03-28 2016-03-28 Track data processing method Active CN105868553B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610184204.4A CN105868553B (en) 2016-03-28 2016-03-28 Track data processing method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610184204.4A CN105868553B (en) 2016-03-28 2016-03-28 Track data processing method

Publications (2)

Publication Number Publication Date
CN105868553A true CN105868553A (en) 2016-08-17
CN105868553B CN105868553B (en) 2018-04-13

Family

ID=56625086

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610184204.4A Active CN105868553B (en) 2016-03-28 2016-03-28 Track data processing method

Country Status (1)

Country Link
CN (1) CN105868553B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110411450A (en) * 2019-07-29 2019-11-05 北京航空航天大学 It is a kind of for compressing the map-matching method of track
CN110427373A (en) * 2019-07-24 2019-11-08 北京航空航天大学 A kind of track data processing method and processing device

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104036139A (en) * 2014-06-12 2014-09-10 中国科学院软件研究所 Moving object trajectory monitoring method

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104036139A (en) * 2014-06-12 2014-09-10 中国科学院软件研究所 Moving object trajectory monitoring method

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
LANGE R: "Efficient real-time trajectory tracking", 《THE VLDB JOURNAL》 *
王欣然 等: "基于PLAZA的移动对象轨迹实时化简方法", 《计算机应用研究》 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110427373A (en) * 2019-07-24 2019-11-08 北京航空航天大学 A kind of track data processing method and processing device
CN110411450A (en) * 2019-07-29 2019-11-05 北京航空航天大学 It is a kind of for compressing the map-matching method of track
CN110411450B (en) * 2019-07-29 2021-04-16 北京航空航天大学 Map matching method for compressing track

Also Published As

Publication number Publication date
CN105868553B (en) 2018-04-13

Similar Documents

Publication Publication Date Title
CN110309706B (en) Face key point detection method and device, computer equipment and storage medium
CN109917430A (en) A kind of satellite positioning track drift method for correcting error based on smooth trajectory algorithm
CN111383464A (en) Vehicle lane change recognition method and device, electronic equipment and medium
CN104076743A (en) Interpolation type automatically identified interpolation control method
CN105868553A (en) Track data processing method
CN111488413A (en) Track characteristic point judgment method, track recording method and related device
CN113177993A (en) Method and system for generating high-precision map in simulation environment
CN110109165B (en) Method and device for detecting abnormal points in driving track
CN116476864A (en) Method, device, system, equipment and medium for smoothing vehicle automatic driving reference line
CN112418193B (en) Lane line identification method and system
CN105700791A (en) Road traffic accident field sketch recognizing and drawing method
CN102737393B (en) Method and system for drawing vector diagram of overhead line
CN104034492A (en) Water pressure testing curve and parameter processing method
CN108333609A (en) Drive test route map-indication method and device
CN116310175A (en) Automatic driving map generation method, equipment and medium
CN103196460A (en) Method and device for estimating step length
CN110411450A (en) It is a kind of for compressing the map-matching method of track
CN113326211B (en) Test case generation method and device
CN106303153A (en) A kind of image processing method and device
CN108287354B (en) Automatic data error correction method and device and navigation equipment
CN110545521A (en) Online compression method and device for track data and computer readable storage medium
CN104266646A (en) Method and device for determining movement direction of terminal
CN109425353B (en) Main and auxiliary road transfer identification method and device
WO2020094023A1 (en) Road thinning algorithm
CN113659936B (en) Segmentation point determination method and device for linearization model

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant