CN105788261A - Road traffic space data compression method based on PCA and LZW coding - Google Patents

Road traffic space data compression method based on PCA and LZW coding Download PDF

Info

Publication number
CN105788261A
CN105788261A CN201610236010.4A CN201610236010A CN105788261A CN 105788261 A CN105788261 A CN 105788261A CN 201610236010 A CN201610236010 A CN 201610236010A CN 105788261 A CN105788261 A CN 105788261A
Authority
CN
China
Prior art keywords
data
section
benchmark
under
road traffic
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
CN201610236010.4A
Other languages
Chinese (zh)
Other versions
CN105788261B (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.)
Zhejiang University of Technology ZJUT
Original Assignee
Zhejiang University of Technology ZJUT
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 Zhejiang University of Technology ZJUT filed Critical Zhejiang University of Technology ZJUT
Priority to CN201610236010.4A priority Critical patent/CN105788261B/en
Publication of CN105788261A publication Critical patent/CN105788261A/en
Application granted granted Critical
Publication of CN105788261B publication Critical patent/CN105788261B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G08SIGNALLING
    • G08GTRAFFIC CONTROL SYSTEMS
    • G08G1/00Traffic control systems for road vehicles
    • G08G1/01Detecting movement of traffic to be counted or controlled
    • G08G1/0104Measuring and analyzing of parameters relative to traffic conditions
    • G08G1/0125Traffic data processing
    • G08G1/0129Traffic data processing for creating historical data or processing based on historical data
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Chemical & Material Sciences (AREA)
  • Analytical Chemistry (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Traffic Control Systems (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

Provided is a road traffic space data compression method based on PCA and LZW coding. The road traffic space data compression method comprises the steps that: a road traffic characteristic reference sequence is established based on road traffic data of different road segments under a same modal and in a same space; a road traffic road segment set having correlation is selected based on PCA; a reference road segment is selected, and data of the reference road segment is regarded as road traffic reference data of the space; historical data of other road segments under the same modal and in the same space is extracted to serve as training data, and an optimal threshold value of spatial road traffic difference data is determined on the basis the road traffic reference data under the same modal and in the same space; data of other road segments in the space is extracted to serve as real-time data; road traffic difference data is obtained on the basis of the traffic reference data under the same modal and in the same space; compression of road traffic space data is realized based on LZW coding; and finally, reconstruction of the road traffic space data is realized based on an LZW decoding technology. The road traffic space data compression method provided by the invention simplifies the calculation and effectively accelerates the processing speed.

Description

A kind of road traffic spatial data compression method of Based PC A and LZW coding
Technical field
The invention belongs to highway traffic data process field, relate to analysis and the compression of highway traffic data, be the compression method of a kind of highway traffic data.
Background technology
Along with the development of intelligent transportation system data acquisition technology, based on the intelligent transportation data that continuous acquisition obtains, field of traffic is about to face mass data problem, it is necessary to it is carried out effective data compression, just can carry out processing, analyze and storing.
The internal characteristics of traffic flow data specifically includes that periodicity, similarity, dependency etc..There is the spatial and temporal association of complexity between the traffic flow of approach way, often similarity is higher, and same traffic flow shows extremely strong dependency and periodicity in time.These similaritys show there is substantial amounts of redundancy in data.
Based on the feature of traffic flow similarity, existing multiple method is applied in highway traffic data compression field at present.Specifically include that PCA (PCA), independent component analysis (ICA), predictive coding and dictionary encoding series process, based on small echo (bag) method such as alternative approach, artificial neural network.It mainly utilizes the thought of transform domain, highway traffic data carries out multi-scale transform and carries out relevant treatment, it is achieved the compression of data, and obtaining good effect.
The big multipair Traffic Net data of existing highway traffic data compression method carry out data compression, study less to the data compression method in relevant road segments time series.
Summary of the invention
In order to overcome the deficiency that algorithm is complicated, processing speed is relatively low of existing highway traffic data compression method, the present invention provides a kind of road traffic spatial data compression method simplifying calculating, effective Based PC A and the LZW coding improving processing speed.
The technical solution adopted for the present invention to solve the technical problems is:
A kind of in the road traffic spatial data compression method of PCA and LZW coding, comprise the following steps:
1) based under same mode, spatially the highway traffic data of different sections of highway set up road traffic features reference sequences;Based PC A method, chooses the road traffic section set with dependency, and its process is as follows:
Extracting the road traffic historical data in s bar section from reason traffic characteristic reference sequences, the collection data in every section are r, and transform it into the matrix of s × r, are designated as: Asⅹr
Matrix AsⅹrThe average of jth row is:
a j = 1 s Σ i = 1 s A i , j - - - ( 1 )
Based on aj, it is thus achieved that AsⅹrNormalization matrix SAsⅹr:
SA i , j = ( A i , j - a j ) ( Σ i = 1 s ( A i , j - a j ) 2 ) - 1 2 - - - ( 2 )
The covariance matrix CSA of normalization matrix SA is:
C S A = 1 s - 1 ( SA T * S A ) - - - ( 3 )
Obtain the eigenvalue D and characteristic vector V of covariance matrix CSA, then D=[λ12…λr];λ1≥λ2≥…≥λr;Characteristic of correspondence vector is: V=[v1,v2…vr];
Choose λ1, λ2The projection matrix VA that characteristic of correspondence vector is constitutedr×2=[v1,v2], based on projection matrix and normalized training matrix, ask for AsⅹrMain constituent matrix A PCr×2:
APCs×2=SAsⅹr×VAr×2(4)
Based on APCs×2, two dimensional surface draws the distribution in s bar section, the distribution density of point represents corresponding road section strength of correlation, by correlation analysis, sets threshold value δ, selects the dependency p+1 bar section more than δ, and its process is as follows:
Wherein, i, j represents i-th respectively, j bar section, 0 < i < s, 0 < j < s;Represent relevance function;
2) selection reference section, and using its data as road traffic benchmark data spatially;Extract under same mode, the historical data in spatially other section, as training data, based on road traffic benchmark data under same mode, spatially, it is determined that the optimal threshold of space road traffic difference data, its process is as follows:
Si(m*Δt,Mgh)=STi(m*Δt,Mgh)-SB(m*Δt,Mgh)(6)
ei(m,Mgh)=[Si(Δt,Mgh)Si(2*Δt,Mgh)...Si(m*Δt,Mgh)](7)
he i ( m , M g h ) = 0 , e i ( m , M g h ) < E i ( m , M g h ) e i ( m , M g h ) , e i ( m , M g h ) > E i ( m , M g h ) - - - ( 8 )
pei(n,Mgh)=w (hei(m,Mgh))(9)
pei(n,Mgh)=[Si'(1,Mgh)Si'(2,Mgh)...Si'(n,Mgh)](10)
Wherein, Δ t is the collection period of road traffic state data;(m* Δ t) is m-th road traffic state data collection cycle, and 0≤m≤N, N represents the quantity of the transport information gathered every day;I (1≤i≤p) represents i-th section;STi(m* Δ t, Mgh) represent mode MghUnder, the highway traffic data in (m* Δ t) moment i section;SB (m* Δ t, Mgh) represent mode MghUnder, the benchmark data in (m* Δ t) moment benchmark section;Si(m* Δ t, Mgh) represent mode MghUnder, the difference data of the training data in (m* Δ t) moment i section and the benchmark data in benchmark section;ei(m, Mgh) represent mode MghUnder, Δ t is to the difference data of the benchmark data in training data and the benchmark section in (m* Δ t) period i section;hei(m, Mgh) represent mode MghUnder, Δ t process to (m* Δ t) period threshold after the difference data of benchmark data in training data and benchmark section in i section;Ei(m, Mgh) represent mode MghUnder, the threshold value chosen to (m* Δ t) period i section of Δ t;pei(n, Mgh) represent mode MghUnder, Δ t is to result after LZW encodes of the difference data in (m* Δ t) period i section and benchmark section;Si' (n, Mgh) for mode MghUnder, Δ t is to nth data in result after LZW encodes of the difference data in (m* Δ t) period i section and benchmark section;M represents at mode MghUnder, Δ t is to the quantity in the i section before (m* Δ t) duration compression with the difference data in benchmark section;N represents at mode MghUnder, Δ t is to the road traffic quantity after (m* Δ t) duration compression;W represents that LZW encodes;Compression ratio is
3) data in spatially other section are extracted, as real time data;Mode MghUnder, based on road traffic benchmark data spatially, obtain road traffic difference data, its general expression is as follows:
MSj(m*Δt,Mgh)=SMj(m*Δt,Mgh)-SB(m*Δt,Mgh)(11)
errj(m,Mgh)=[MSj(Δt,Mgh)MSj(2*Δt,Mgh)...MSj(m*Δt,Mgh)](12)
Wherein, j (1≤i≤p) represents j-th strip section;SMj(m* Δ t, Mgh) represent mode MghUnder, the real time data in (m* Δ t) moment j section;MSj(m* Δ t, Mgh) for mode MghUnder, the difference data of the real time data in (m* Δ t) moment j section and the benchmark data in benchmark section;errj(m, Mgh) for mode MghUnder, Δ t is to the difference data of the benchmark data in real time data and the benchmark section in (m* Δ t) period j section;
4) realize the compression of road traffic spatial data based on LZW coding, its process is as follows:
The optimal threshold that the difference data in i section with benchmark section is trained is incorporated into same mode Mgh, j section and benchmark section difference data in, encode in conjunction with LZW, it is achieved the compression of j section and benchmark section difference data, its general expression is as follows:
herr j ( m * &Delta; t , M g h ) = 0 , err j ( m * &Delta; t , M g h ) < E o p t ( M g h ) err j ( m * &Delta; t , M g h ) , err j ( m , M g h ) > E o p t ( M g h ) - - - ( 13 )
herrsp(m*Δt,Mgh)=[herr1(m*Δt,Mgh)herr2(Δt,Mgh)...herrp'(m*Δt,Mgh)](14)
perrp'(m*Δt,Mgh)=w (herrsp(m*Δt,Mgh))(15)
perrp'(m*Δt,Mgh)=[MS1(m*Δt,Mgh)MS2(m*Δt,Mgh)...MSp'(m*Δt,Mgh)](16)
Wherein, Eopt(Mgh) represent the optimal threshold trained;herrj(m* Δ t, Mgh) represent mode MghUnder, the difference data of the benchmark data in the real time data in j section and benchmark section after (m* Δ t) moment threshold process;M represents mode MghUnder, Δ t is to the quantity in j section before (m* Δ t) duration compression with the difference data in benchmark section;herrsp(m*Δt,Mgh) represent mode MghUnder, the magnitude-set of (m* Δ t) moment p bar section difference data;Perrp’(m*Δt,Mgh) represent mode MghUnder, the magnitude-set of difference data after the compression of (m* Δ t) moment p bar section;MSj' (m* Δ t, Mgh) represent mode MghUnder, quantity after the compression of the difference data in (m* Δ t) moment j section;P ' represents the quantity after (m* Δ t) moment LZW coding;Compression ratio is:
Further, described compression method also comprises the steps:
5) based on LZW decoding technique, it is achieved road traffic spatial data reconstructs, and its process is as follows:
The difference data in p bar section Yu benchmark section being reconstructed, in conjunction with benchmark data, it is achieved the decompression of p bar section real time data, its general expression is as follows:
dperrp(m*Δt,Mgh)=w'(perrp'(m*Δt,Mgh))(17)
dperrj(m,Mgh)=w'(perrj(Tn,Mgh))(18)
CSMj(m,Mgh)=SB (m, Mgh)+dperrj(m,Mgh)(19)
Wherein, w ' represents the decoding of LZW;dperrp(m* Δ t, Mgh) represent mode MghUnder, the difference data in (m* Δ t) moment decoded p section and benchmark section;CSMp(m* Δ t, Mgh) represent mode MghUnder, the highway traffic data in p bar section of (m* Δ t) moment reconstruct.
The technology of the present invention is contemplated that: owing to the trip requirements of traffic participant, travel time and space have certain regularity, therefore the road traffic state of relevant road segments has very strong dependency on similar timing node, namely the road traffic state change curve of relevant road segments has certain similarity.Therefore the present invention is based on the feature of the spatial coherence of road traffic system, it is compressed for relevant road segments road traffic spatial data.It is primarily based on PCA method, selects the section set with dependency;Secondly selection reference section and dependency section, and using its data as road traffic benchmark data spatially and training data;Then its difference data is obtained, it is determined that the optimal threshold of road traffic space interpolation data;Further, obtain the real time data of other relevant road segments, based on road traffic benchmark data, obtain its difference data;Finally, based on LZW coding and decoding technology, compression and the reconstruct of road traffic space interpolation data are realized respectively.
Beneficial effects of the present invention is mainly manifested in: simplification calculates, effectively improves processing speed.
Accompanying drawing explanation
Fig. 1 is based on the flow chart of the road traffic spatial data compression method of PCA and LZW coding.
Fig. 2 is the flow chart of reconstructing method.
Detailed description of the invention
Below in conjunction with accompanying drawing, the invention will be further described.
See figures.1.and.2, a kind of road traffic spatial data compression method based on LZW coding, comprise the steps:
1) based under same mode, spatially the highway traffic data of different sections of highway set up road traffic features reference sequences;Based PC A method, chooses the road traffic section set with dependency, and its process is as follows:
Extracting the road traffic historical data in s bar section from reason traffic characteristic reference sequences, the collection data in every section are r, and transform it into the matrix of s × r, are designated as: Asⅹr
Matrix AsⅹrThe average of jth row is:
a j = 1 s &Sigma; i = 1 s A i , j - - - ( 1 )
Based on aj, it is thus achieved that AsⅹrNormalization matrix SAsⅹr:
SA i , j = ( A i , j - a j ) ( &Sigma; i = 1 s ( A i , j - a j ) 2 ) - 1 2 - - - ( 2 )
The covariance matrix CSA of normalization matrix SA is:
C S A = 1 s - 1 ( SA T * S A ) - - - ( 3 )
Obtain the eigenvalue D and characteristic vector V of covariance matrix CSA, then D=[λ12…λr];λ1≥λ2≥…≥λr;Characteristic of correspondence vector is: V=[v1,v2…vr];
Choose λ1, λ2The projection matrix VA that characteristic of correspondence vector is constitutedr×2=[v1,v2], based on projection matrix and normalized training matrix, ask for AsⅹrMain constituent matrix A PCr×2:
APCs×2=SAsⅹr×VAr×2(4)
Based on APCs×2, two dimensional surface draws the distribution in s bar section, the distribution density of point represents corresponding road section strength of correlation, by correlation analysis, sets threshold value δ, selects the dependency p+1 bar section more than δ, and its process is as follows:
Wherein, i, j represents i-th respectively, j bar section, 0 < i < s, 0 < j < s;Represent relevance function;
2) selection reference section, and using its data as road traffic benchmark data spatially;Extract under same mode, the historical data in spatially other section, as training data, based on road traffic benchmark data under same mode, spatially, it is determined that the optimal threshold of space road traffic difference data, its process is as follows:
Si(m*Δt,Mgh)=STi(m*Δt,Mgh)-SB(m*Δt,Mgh)(6)
ei(m,Mgh)=[Si(Δt,Mgh)Si(2*Δt,Mgh)...Si(m*Δt,Mgh)](7)
he i ( m , M g h ) = 0 , e i ( m , M g h ) < E i ( m , M g h ) e i ( m , M g h ) , e i ( m , M g h ) > E i ( m , M g h ) - - - ( 8 )
pei(n,Mgh)=w (hei(m,Mgh))(9)
pei(n,Mgh)=[Si'(1,Mgh)Si'(2,Mgh)...Si'(n,Mgh)](10)
Wherein, Δ t is the collection period of road traffic state data;(m* Δ t) is m-th road traffic state data collection cycle, and 0≤m≤N, N represents the quantity of the transport information gathered every day;I (1≤i≤p) represents i-th section;STi(m* Δ t, Mgh) represent mode MghUnder, the highway traffic data in (m* Δ t) moment i section;SB (m* Δ t, Mgh) represent mode MghUnder, the benchmark data in (m* Δ t) moment benchmark section;Si(m* Δ t, Mgh) represent mode MghUnder, the difference data of the training data in (m* Δ t) moment i section and the benchmark data in benchmark section;ei(m, Mgh) represent mode MghUnder, Δ t is to the difference data of the benchmark data in training data and the benchmark section in (m* Δ t) period i section;hei(m, Mgh) represent mode MghUnder, Δ t process to (m* Δ t) period threshold after the difference data of benchmark data in training data and benchmark section in i section;Ei(m, Mgh) represent mode MghUnder, the threshold value chosen to (m* Δ t) period i section of Δ t;pei(n, Mgh) represent mode MghUnder, Δ t is to result after LZW encodes of the difference data in (m* Δ t) period i section and benchmark section;Si' (n, Mgh) for mode MghUnder, Δ t is to nth data in result after LZW encodes of the difference data in (m* Δ t) period i section and benchmark section;M represents at mode MghUnder, Δ t is to the quantity in the i section before (m* Δ t) duration compression with the difference data in benchmark section;N represents at mode MghUnder, Δ t is to the road traffic quantity after (m* Δ t) duration compression;W represents that LZW encodes;Compression ratio is
3) data in spatially other section are extracted, as real time data;Mode MghUnder, based on road traffic benchmark data spatially, obtain road traffic difference data, its general expression is as follows:
MSj(m*Δt,Mgh)=SMj(m*Δt,Mgh)-SB(m*Δt,Mgh)(11)
errj(m,Mgh)=[MSj(Δt,Mgh)MSj(2*Δt,Mgh)...MSj(m*Δt,Mgh)](12)
Wherein, j (1≤i≤p) represents j-th strip section;SMj(m* Δ t, Mgh) represent mode MghUnder, the real time data in (m* Δ t) moment j section;MSj(m* Δ t, Mgh) for mode MghUnder, the difference data of the real time data in (m* Δ t) moment j section and the benchmark data in benchmark section;errj(m, Mgh) for mode MghUnder, Δ t is to the difference data of the benchmark data in real time data and the benchmark section in (m* Δ t) period j section.
4) realize the compression of road traffic spatial data based on LZW coding, its process is as follows:
The optimal threshold that the difference data in i section with benchmark section is trained is incorporated into same mode Mgh, j section and benchmark section difference data in, encode in conjunction with LZW, it is achieved the compression of j section and benchmark section difference data, its general expression is as follows:
herr j ( m * &Delta; t , M g h ) = 0 , err j ( m * &Delta; t , M g h ) < E o p t ( M g h ) err j ( m * &Delta; t , M g h ) , err j ( m , M g h ) > E o p t ( M g h ) - - - ( 13 )
herrsp(m*Δt,Mgh)=[herr1(m*Δt,Mgh)herr2(Δt,Mgh)...herrp'(m*Δt,Mgh)](14)
perrp'(m*Δt,Mgh)=w (herrsp(m*Δt,Mgh))(15)
perrp'(m*Δt,Mgh)=[MS1(m*Δt,Mgh)MS2(m*Δt,Mgh)...MSp'(m*Δt,Mgh)](16)
Wherein, Eopt(Mgh) represent the optimal threshold trained;herrj(m* Δ t, Mgh) represent mode MghUnder, the difference data of the benchmark data in the real time data in j section and benchmark section after (m* Δ t) moment threshold process;M represents mode MghUnder, Δ t is to the quantity in j section before (m* Δ t) duration compression with the difference data in benchmark section;herrsp(m*Δt,Mgh) represent mode MghUnder, the magnitude-set of (m* Δ t) moment p bar section difference data;Perrp’(m*Δt,Mgh) represent mode MghUnder, the magnitude-set of difference data after the compression of (m* Δ t) moment p bar section;MSj' (m* Δ t, Mgh) represent mode MghUnder, (the m* Δ t) moment, j section difference data compression after quantity;P ' represents the quantity after (m* Δ t) moment LZW coding;Compression ratio is:
5) based on LZW decoding technique, it is achieved road traffic spatial data reconstructs, and its process is as follows:
The difference data in p bar section Yu benchmark section being reconstructed, in conjunction with benchmark data, it is achieved the decompression of p bar section real time data, its general expression is as follows:
dperrp(m*Δt,Mgh)=w'(perrp'(m*Δt,Mgh))(17)
dperrj(m,Mgh)=w'(perrj(Tn,Mgh))(18)
CSMj(m,Mgh)=SB (m, Mgh)+dperrj(m,Mgh)(19)
Wherein, w ' represents the decoding of LZW;dperrp(m* Δ t, Mgh) represent mode MghUnder, the difference data in (m* Δ t) moment decoded p section and benchmark section;CSMp(m* Δ t, Mgh) represent mode MghUnder, the highway traffic data in p bar section of (m* Δ t) moment reconstruct.
Example: the road traffic spatial data compression method of a kind of Based PC A and LZW coding, comprises the following steps:
1) based under same mode, spatially the highway traffic data of different sections of highway set up road traffic features reference sequences;Based PC A method, chooses the road traffic section set with dependency, and its process is as follows:
This test using section, 6, Beijing, weekend (18,19,25,26) same test point measured discharge data four day June in 2011 (sampling interval was for 2 minutes) as sample sequence, shown in road section information table 1.
Table 1
Extracting the road traffic historical data in 6 sections from reason traffic characteristic reference sequences, the collection data in every section are 720, and transform it into the matrix of s × r, and namely s is 6, r is 720, is designated as: Asⅹr
Matrix AsⅹrThe average of jth row is:
a j = 1 s &Sigma; i = 1 s A i , j - - - ( 1 )
Based on aj, it is thus achieved that AsⅹrNormalization matrix SAsⅹr:
SA i , j = ( A i , j - a j ) ( &Sigma; i = 1 s ( A i , j - a j ) 2 ) - 1 2 - - - ( 2 )
The covariance matrix CSA of normalization matrix SA is:
C S A = 1 s - 1 ( SA T * S A ) - - - ( 3 )
Obtain the eigenvalue D and characteristic vector V of covariance matrix CSA, then D=[λ12…λr];λ1≥λ2≥…≥λr;Characteristic of correspondence vector is: V=[v1,v2…vr]。
Choose λ1, λ2The projection matrix VA that characteristic of correspondence vector is constitutedr×2=[v1,v2], based on projection matrix and normalized training matrix, ask for AsⅹrMain constituent matrix A PCr×2:
APCs×2=SAsⅹr×VAr×2(4)
Based on APCs×2, two dimensional surface draws the distribution in s bar section, the distribution density of point represents corresponding road section strength of correlation.By correlation analysis, setting threshold value δ, select the dependency p+1 bar section more than δ, its process is as follows:
Wherein, i, j represents i-th respectively, j bar section, 0 < i < s, 0 < j < s;Represent relevance function;
2) selection reference section, and using its data as road traffic benchmark data spatially;Extract under same mode, the historical data in spatially other section, as training data, based on road traffic benchmark data under same mode, spatially, it is determined that the optimal threshold of space road traffic difference data, its process is as follows:
Si(m*Δt,Mgh)=STi(m*Δt,Mgh)-SB(m*Δt,Mgh)(6)
ei(m,Mgh)=[Si(Δt,Mgh)Si(2*Δt,Mgh)...Si(m*Δt,Mgh)](7)
he i ( m , M g h ) = 0 , e i ( m , M g h ) < E i ( m , M g h ) e i ( m , M g h ) , e i ( m , M g h ) > E i ( m , M g h ) - - - ( 8 )
pei(n,Mgh)=w (hei(m,Mgh))(9)
pei(n,Mgh)=[Si'(1,Mgh)Si'(2,Mgh)...Si'(n,Mgh)](10)
Wherein, Δ t is the collection period of road traffic state data;(m* Δ t) is m-th road traffic state data collection cycle, and 0≤m≤N, N represents the quantity of the transport information gathered every day;I (1≤i≤p) represents i-th section;STi(m* Δ t, Mgh) represent mode MghUnder, the highway traffic data in (m* Δ t) moment i section;SB (m* Δ t, Mgh) represent mode MghUnder, the benchmark data in (m* Δ t) moment benchmark section;Si(m* Δ t, Mgh) represent mode MghUnder, the difference data of the training data in (m* Δ t) moment i section and the benchmark data in benchmark section;ei(m, Mgh) represent mode MghUnder, Δ t is to the difference data of the benchmark data in training data and the benchmark section in (m* Δ t) period i section;hei(m, Mgh) represent mode MghUnder, Δ t process to (m* Δ t) period threshold after the difference data of benchmark data in training data and benchmark section in i section;Ei(m, Mgh) represent mode MghUnder, the threshold value chosen to (m* Δ t) period i section of Δ t;pei(n, Mgh) represent mode MghUnder, Δ t is to result after LZW encodes of the difference data in (m* Δ t) period i section and benchmark section;Si' (n, Mgh) for mode MghUnder, Δ t is to nth data in result after LZW encodes of the difference data in (m* Δ t) period i section and benchmark section;M represents at mode MghUnder, Δ t is to the quantity in the i section before (m* Δ t) duration compression with the difference data in benchmark section;N represents at mode MghUnder, Δ t is to the road traffic quantity after (m* Δ t) duration compression;W represents that LZW encodes;Compression ratio is
3) data in spatially other section are extracted, as real time data;Mode MghUnder, based on road traffic benchmark data spatially, obtain road traffic difference data, its general expression is as follows:
MSj(m*Δt,Mgh)=SMj(m*Δt,Mgh)-SB(m*Δt,Mgh)(11)
errj(m,Mgh)=[MSj(Δt,Mgh)MSj(2*Δt,Mgh)...MSj(m*Δt,Mgh)](12)
Wherein, j (1≤i≤p) represents j-th strip section;SMj(m* Δ t, Mgh) represent mode MghUnder, the real time data in (m* Δ t) moment j section;MSj(m* Δ t, Mgh) for mode MghUnder, the difference data of the real time data in (m* Δ t) moment j section and the benchmark data in benchmark section;errj(m, Mgh) for mode MghUnder, Δ t is to the difference data of the benchmark data in real time data and the benchmark section in (m* Δ t) period j section.
4) realize the compression of road traffic spatial data based on LZW coding, its process is as follows:
The optimal threshold that the difference data in i section with benchmark section is trained is incorporated into same mode Mgh, j section and benchmark section difference data in, encode in conjunction with LZW, it is achieved the compression of j section and benchmark section difference data, its general expression is as follows:
herr j ( m * &Delta; t , M g h ) = 0 , err j ( m * &Delta; t , M g h ) < E o p t ( M g h ) err j ( m * &Delta; t , M g h ) , err j ( m , M g h ) > E o p t ( M g h ) - - - ( 13 )
herrsp(m*Δt,Mgh)=[herr1(m*Δt,Mgh)herr2(Δt,Mgh)...herrp'(m*Δt,Mgh)](14)
perrp'(m*Δt,Mgh)=w (herrsp(m*Δt,Mgh))(15)
perrp'(m*Δt,Mgh)=[MS1(m*Δt,Mgh)MS2(m*Δt,Mgh)...MSp'(m*Δt,Mgh)](16)
Wherein, Eopt(Mgh) represent the optimal threshold trained;herrj(m* Δ t, Mgh) represent mode MghUnder, the difference data of the benchmark data in the real time data in j section and benchmark section after (m* Δ t) moment threshold process;M represents mode MghUnder, Δ t is to the quantity in j section before (m* Δ t) duration compression with the difference data in benchmark section;herrsp(m*Δt,Mgh) represent mode MghUnder, the magnitude-set of (m* Δ t) moment p bar section difference data;Perrp’(m*Δt,Mgh) represent mode MghUnder, the magnitude-set of difference data after the compression of (m* Δ t) moment p bar section;MSj' (m* Δ t, Mgh) represent mode MghUnder, (the m* Δ t) moment, j section difference data compression after quantity;P ' represents the quantity after (m* Δ t) moment LZW coding;Compression ratio is:
5) based on LZW decoding technique, it is achieved road traffic spatial data reconstructs, and its process is as follows:
The difference data in p bar section Yu benchmark section being reconstructed, in conjunction with benchmark data, it is achieved the decompression of p bar section real time data, its general expression is as follows:
dperrp(m*Δt,Mgh)=w'(perrp'(m*Δt,Mgh))(17)
dperrj(m,Mgh)=w'(perrj(Tn,Mgh))(18)
CSMj(m,Mgh)=SB (m, Mgh)+dperrj(m,Mgh)(19)
Wherein, w ' represents the decoding of LZW;dperrp(m* Δ t, Mgh) represent mode MghUnder, the difference data in (m* Δ t) moment decoded p section and benchmark section;CSMp(m* Δ t, Mgh) represent mode MghUnder, the highway traffic data in p bar section of (m* Δ t) moment reconstruct.
6) parameter of the road traffic spatial data compression of Based PC A and LZW coding is determined
In the road traffic spatial data compression process of Based PC A and LZW coding, it is designed into following parameter: SB (m* Δ t), STi(m*Δt)、Ei(m* Δ t), per, erri(m* Δ t), n, wherein, Ei(m* Δ t) can be obtained by SB (m) and per, n and erri(m* Δ t) can by SB (m* Δ t), STi(m*Δt),Ei(m* Δ t) determines, the parameter setting done here is the general impact analysis to the road traffic spatial data compression encoded based on LZW.
Owing to the precision of algorithm is respectively arranged with impact by these parameters, individually analyze each parameter and the impact of arithmetic accuracy is not ensured that the optimum of algorithm, therefore should consider the impact that this highway traffic data is compressed by all parameters when carrying out Algorithm Analysis simultaneously.
Introduce compression alignment parameters the impact of arithmetic accuracy is analyzed:
CR p ( m , M g h ) = CM a ( m , M g h ) CM b ( m , M g h ) - - - ( 20 )
Wherein, CRp(m,Mgh) represent at mode MghUnder, Δ t is to the compression ratio in (m* Δ t) period p bar section;CMa(m,Mgh) represent at mode MghUnder, Δ t to (m* Δ t) period p bar section compression before data amount check;CMb(m,Mgh) be expressed as at mode MghUnder, Δ t to (m* Δ t) period p bar section compress after data amount check.
Namely for different (SB (m* Δ t, Mgh), STj(m* Δ t, Mgh), Per), there is corresponding CRp(m,Mgh).Therefore there is following equation:
CRp(m* Δ t, Mgh)=f (SB (m* Δ t, Mgh), STj(m* Δ t, Mgh), Per) (21)
I.e. f (SB (m* Δ t, Mgh), STj(m* Δ t, Mgh), Per) and CRp(m* Δ t, Mgh) there is certain distribution relation f, find CRp(m* Δ t, Mgh) maximum time corresponding (SB (m, Mgh), STj(m, Mgh), Per), it is optimized parameter and sets process.Therefore can obtain such as drag:
Minf (SB (m* Δ t, Mgh), STj(m* Δ t, Mgh), Per) (22)
W h e r e CR p ( m * &Delta; t , M g h ) = CM a ( m * &Delta; t , M g h ) CM b ( m * &Delta; t , M g h )
Finally (SB (m* Δ t, Mgh), STj(m* Δ t, Mgh), Per) value can be determined by the training of road traffic benchmark data and training data.
7) experimental result
Based on road traffic space reference data and the training data of same mode, obtain optimized parameter (SB ((m* Δ t), STj(m), Per).This experimental result is compressed mainly for the car amount velocity amplitude in section.Extract road traffic space real time data, encode based on LZW, it is achieved the compression of road traffic space real time data.
Choose compression ratio (CR), absolute error (AE), to percentage error (marerr), error to standard deviation (σ) as the index of road traffic flow precision of prediction, CR is in the existing description of formula (20), and all the other computing formula are as follows respectively:
A E = 1 p &Sigma; p | CSM p ( m * &Delta; t , M g h ) - SM p ( m * &Delta; t , M g h ) | - - - ( 23 )
m a r e r r = 1 p &Sigma; p | CSM p ( m * &Delta; t , M g h ) - SM p ( m * &Delta; t , M g h ) | SM p ( m * &Delta; t , M g h ) - - - ( 24 )
&sigma; = &Sigma; p ( y p ( m * &Delta; t , M g h ) - e p &OverBar; ( m * &Delta; t , M g h ) ) p - 1 - - - ( 25 )
Wherein
yp(m*Δt,Mgh)=CSMp(m*Δt,Mgh)-SMp(m*Δt,Mgh)
e p - ( m * &Delta; t , M g h ) = 1 p &Sigma; p y p ( m * &Delta; t , M g h )
Wherein, yp(m*Δt,Mgh) represent mode MghUnder, the error amount of real time data after (m* Δ t) moment p bar section real time data and reconstruct,For mean error.
Based on above analysis, it is known that the road traffic section with dependency is three sections of HI3009b, HI3008b and HI7058b.The data selecting these three sections are compressed research and the application of algorithm.
HI3009b, HI7058b section compression result statistical analysis such as table 2 below, shown in 3.
Date 18 19 25 26 average
CR 11.80 10.91 11.08 9.00 10.70
AE 11.24 10.94 12.43 12.05 11.67
marerr 12.42 12.54 12.78 13.87 12.90
σ 13.93 12.56 14.88 13.64 13.75
Table 2
Date 18 19 25 26 average
CR 16.74 16.00 15.65 11.80 15.05
AE 6.65 6.93 6.83 7.41 6.96
marerr 6.87 7.67 7.07 8.51 7.53
σ 8.65 9.33 8.87 9.79 9.16
Table 3.

Claims (2)

1. the road traffic spatial data compression method of a Based PC A and LZW coding, it is characterised in that: said method comprising the steps of:
1) based under same mode, spatially the highway traffic data of different sections of highway set up road traffic features reference sequences;Based PC A method, chooses the road traffic section set with dependency, and its process is as follows:
Extracting the road traffic historical data in s bar section from reason traffic characteristic reference sequences, the collection data in every section are r, and transform it into the matrix of s × r, are designated as: Asⅹr
Matrix AsⅹrThe average of jth row is:
a j = 1 s &Sigma; i = 1 s A i , j - - - ( 1 )
Based on aj, it is thus achieved that AsⅹrNormalization matrix SAsⅹr:
SA i , j = ( A i , j - a j ) ( &Sigma; i = 1 s ( A i , j - a j ) 2 ) - 1 2 - - - ( 2 )
The covariance matrix CSA of normalization matrix SA is:
C S A = 1 s - 1 ( SA T * S A ) - - - ( 3 )
Obtain the eigenvalue D and characteristic vector V of covariance matrix CSA, then D=[λ12…λr];λ1≥λ2≥…≥λr;Characteristic of correspondence vector is: V=[v1,v2…vr];
Choose λ1, λ2The projection matrix VA that characteristic of correspondence vector is constitutedr×2=[v1,v2], based on projection matrix and normalized training matrix, ask for AsⅹrMain constituent matrix A PCr×2:
APCs×2=SAsⅹr×VAr×2(4)
Based on APCs×2, two dimensional surface draws the distribution in s bar section, the distribution density of point represents corresponding road section strength of correlation, by correlation analysis, sets threshold value δ, selects the dependency p+1 bar section more than δ, and its process is as follows:
Wherein, i, j represents i-th respectively, j bar section, 0 < i < s, 0 < j < s;Represent relevance function;
2) selection reference section, and using its data as road traffic benchmark data spatially;Extract under same mode, the historical data in spatially other section, as training data, based on road traffic benchmark data under same mode, spatially, it is determined that the optimal threshold of space road traffic difference data, its process is as follows:
Si(m*Δt,Mgh)=STi(m*Δt,Mgh)-SB(m*Δt,Mgh)(6)
ei(m,Mgh)=[Si(Δt,Mgh)Si(2*Δt,Mgh)...Si(m*Δt,Mgh)](7)
he i ( m , M g h ) = 0 , e i ( m , M g h ) < E i ( m , M g h ) e i ( m , M g h ) , e i ( m , M g h ) > E i ( m , M g h ) - - - ( 8 )
pei(n,Mgh)=w (hei(m,Mgh))(9)
pei(n,Mgh)=[Si'(1,Mgh)Si'(2,Mgh)...Si'(n,Mgh)](10)
Wherein, Δ t is the collection period of road traffic state data;(m* Δ t) is m-th road traffic state data collection cycle, and 0≤m≤N, N represents the quantity of the transport information gathered every day;I (1≤i≤p) represents i-th section;STi(m* Δ t, Mgh) represent mode MghUnder, the highway traffic data in (m* Δ t) moment i section;SB (m* Δ t, Mgh) represent mode MghUnder, the benchmark data in (m* Δ t) moment benchmark section;Si(m* Δ t, Mgh) represent mode MghUnder, the difference data of the training data in (m* Δ t) moment i section and the benchmark data in benchmark section;ei(m, Mgh) represent mode MghUnder, Δ t is to the difference data of the benchmark data in training data and the benchmark section in (m* Δ t) period i section;hei(m, Mgh) represent mode MghUnder, Δ t process to (m* Δ t) period threshold after the difference data of benchmark data in training data and benchmark section in i section;Ei(m, Mgh) represent mode MghUnder, the threshold value chosen to (m* Δ t) period i section of Δ t;pei(n, Mgh) represent mode MghUnder, Δ t is to result after LZW encodes of the difference data in (m* Δ t) period i section and benchmark section;Si' (n, Mgh) for mode MghUnder, Δ t is to nth data in result after LZW encodes of the difference data in (m* Δ t) period i section and benchmark section;M represents at mode MghUnder, Δ t is to the quantity in the i section before (m* Δ t) duration compression with the difference data in benchmark section;N represents at mode MghUnder, Δ t is to the road traffic quantity after (m* Δ t) duration compression;W represents that LZW encodes;Compression ratio is
3) data in spatially other section are extracted, as real time data;Mode MghUnder, based on road traffic benchmark data spatially, obtain road traffic difference data, its general expression is as follows:
MSj(m*Δt,Mgh)=SMj(m*Δt,Mgh)-SB(m*Δt,Mgh)(11)
errj(m,Mgh)=[MSj(Δt,Mgh)MSj(2*Δt,Mgh)...MSj(m*Δt,Mgh)](12)
Wherein, j (1≤i≤p) represents j-th strip section;SMj(m* Δ t, Mgh) represent mode MghUnder, the real time data in (m* Δ t) moment j section;MSj(m* Δ t, Mgh) for mode MghUnder, the difference data of the real time data in (m* Δ t) moment j section and the benchmark data in benchmark section;errj(m, Mgh) for mode MghUnder, Δ t is to the difference data of the benchmark data in real time data and the benchmark section in (m* Δ t) period j section;
4) realize the compression of road traffic spatial data based on LZW coding, its process is as follows:
The optimal threshold that the difference data in i section with benchmark section is trained is incorporated into same mode Mgh, j section and benchmark section difference data in, encode in conjunction with LZW, it is achieved the compression of j section and benchmark section difference data, its general expression is as follows:
herr j ( m * &Delta; t , M g h ) = 0 , err j ( m * &Delta; t , M g h ) < E o p t ( M g h ) err j ( m * &Delta; t , M g h ) , err j ( m , M g h ) > E o p t ( M g h ) - - - ( 13 )
herrsp(m*Δt,Mgh)=[herr1(m*Δt,Mgh)herr2(Δt,Mgh)...herrp'(m*Δt,Mgh)](14)
perrp'(m*Δt,Mgh)=w (herrsp(m*Δt,Mgh))(15)
perrp'(m*Δt,Mgh)=[MS1(m*Δt,Mgh)MS2(m*Δt,Mgh)...MSp'(m*Δt,Mgh)](16)
Wherein, Eopt(Mgh) represent the optimal threshold trained;herrj(m* Δ t, Mgh) represent mode MghUnder, the difference data of the benchmark data in the real time data in j section and benchmark section after (m* Δ t) moment threshold process;M represents mode MghUnder, Δ t is to the quantity in j section before (m* Δ t) duration compression with the difference data in benchmark section;herrsp(m*Δt,Mgh) represent mode MghUnder, the magnitude-set of (m* Δ t) moment p bar section difference data;Perrp’(m*Δt,Mgh) represent mode MghUnder, the magnitude-set of difference data after the compression of (m* Δ t) moment p bar section;MSj' (m* Δ t, Mgh) represent mode MghUnder, (the m* Δ t) moment, j section difference data compression after quantity;P ' represents the quantity after (m* Δ t) moment LZW coding;Compression ratio is:
2. the road traffic spatial data compression method of Based PC A and LZW coding as claimed in claim 1, it is characterised in that: described compression method also comprises the steps:
5) based on LZW decoding technique, it is achieved road traffic spatial data reconstructs, and its process is as follows:
The difference data in p bar section Yu benchmark section being reconstructed, in conjunction with benchmark data, it is achieved the decompression of p bar section real time data, its general expression is as follows:
dperrp(m*Δt,Mgh)=w'(perrp'(m*Δt,Mgh))(17)
dperrj(m,Mgh)=w'(perrj(Tn,Mgh))(18)
CSMj(m,Mgh)=SB (m, Mgh)+dperrj(m,Mgh)(19)
Wherein, w ' represents the decoding of LZW;dperrp(m* Δ t, Mgh) represent mode MghUnder, the difference data in (m* Δ t) moment decoded p section and benchmark section;CSMp(m* Δ t, Mgh) represent mode MghUnder, the highway traffic data in p bar section of (m* Δ t) moment reconstruct.
CN201610236010.4A 2016-04-15 2016-04-15 A kind of road traffic spatial data compression method encoded based on PCA and LZW Active CN105788261B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610236010.4A CN105788261B (en) 2016-04-15 2016-04-15 A kind of road traffic spatial data compression method encoded based on PCA and LZW

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610236010.4A CN105788261B (en) 2016-04-15 2016-04-15 A kind of road traffic spatial data compression method encoded based on PCA and LZW

Publications (2)

Publication Number Publication Date
CN105788261A true CN105788261A (en) 2016-07-20
CN105788261B CN105788261B (en) 2018-09-21

Family

ID=56397714

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610236010.4A Active CN105788261B (en) 2016-04-15 2016-04-15 A kind of road traffic spatial data compression method encoded based on PCA and LZW

Country Status (1)

Country Link
CN (1) CN105788261B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108629410A (en) * 2018-04-28 2018-10-09 中国科学院计算技术研究所 Based on principal component analysis dimensionality reduction and/or rise the Processing with Neural Network method tieed up
CN111369794A (en) * 2020-02-28 2020-07-03 腾讯科技(深圳)有限公司 Method, device and equipment for determining traffic participation information and storage medium
CN112185122A (en) * 2020-10-28 2021-01-05 中国地质大学(武汉) Self-adaptive neighborhood determination method combining spatial structure and attribute information
CN115964347A (en) * 2023-03-16 2023-04-14 菏泽市产品检验检测研究院 Intelligent storage method for data of market supervision monitoring center
CN116489378A (en) * 2023-06-21 2023-07-25 昇显微电子(苏州)股份有限公司 PCA-based 3D LUT data compression and decompression method and system

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6789052B1 (en) * 2000-10-24 2004-09-07 Advanced Micro Devices, Inc. Method of using control models for data compression
CN101848529A (en) * 2010-03-31 2010-09-29 中国地质大学(武汉) Method for compressing multiple principle component analysis data of wireless sensor network
KR20110115281A (en) * 2010-04-15 2011-10-21 성균관대학교산학협력단 Partitioning method for high dimensional data
CN103501438A (en) * 2013-09-18 2014-01-08 浙江大学 Content self-adaptation image compression method based on PCA
CN105427583A (en) * 2015-11-27 2016-03-23 浙江工业大学 LZW-coding-based road traffic data compression method
CN105469601A (en) * 2015-12-09 2016-04-06 浙江工业大学 A road traffic space data compression method based on LZW coding

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6789052B1 (en) * 2000-10-24 2004-09-07 Advanced Micro Devices, Inc. Method of using control models for data compression
CN101848529A (en) * 2010-03-31 2010-09-29 中国地质大学(武汉) Method for compressing multiple principle component analysis data of wireless sensor network
KR20110115281A (en) * 2010-04-15 2011-10-21 성균관대학교산학협력단 Partitioning method for high dimensional data
CN103501438A (en) * 2013-09-18 2014-01-08 浙江大学 Content self-adaptation image compression method based on PCA
CN105427583A (en) * 2015-11-27 2016-03-23 浙江工业大学 LZW-coding-based road traffic data compression method
CN105469601A (en) * 2015-12-09 2016-04-06 浙江工业大学 A road traffic space data compression method based on LZW coding

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
赵志强 等: "基于PCA和ICA的交通流量数据压缩方法比较研究", 《公路交通科技》 *

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108629410A (en) * 2018-04-28 2018-10-09 中国科学院计算技术研究所 Based on principal component analysis dimensionality reduction and/or rise the Processing with Neural Network method tieed up
CN108629410B (en) * 2018-04-28 2021-01-22 中国科学院计算技术研究所 Neural network processing method based on principal component analysis dimension reduction and/or dimension increase
CN111369794A (en) * 2020-02-28 2020-07-03 腾讯科技(深圳)有限公司 Method, device and equipment for determining traffic participation information and storage medium
CN111369794B (en) * 2020-02-28 2022-01-25 腾讯科技(深圳)有限公司 Method, device and equipment for determining traffic participation information and storage medium
CN112185122A (en) * 2020-10-28 2021-01-05 中国地质大学(武汉) Self-adaptive neighborhood determination method combining spatial structure and attribute information
CN112185122B (en) * 2020-10-28 2022-05-20 中国地质大学(武汉) Self-adaptive neighborhood determination method combining spatial structure and attribute information
CN115964347A (en) * 2023-03-16 2023-04-14 菏泽市产品检验检测研究院 Intelligent storage method for data of market supervision monitoring center
CN116489378A (en) * 2023-06-21 2023-07-25 昇显微电子(苏州)股份有限公司 PCA-based 3D LUT data compression and decompression method and system
CN116489378B (en) * 2023-06-21 2023-08-25 昇显微电子(苏州)股份有限公司 PCA-based 3D LUT data compression and decompression method and system

Also Published As

Publication number Publication date
CN105788261B (en) 2018-09-21

Similar Documents

Publication Publication Date Title
CN105788261A (en) Road traffic space data compression method based on PCA and LZW coding
Croitoru et al. Diffusion models in vision: A survey
CN109884419B (en) Smart power grid power quality online fault diagnosis method
CN108898829A (en) The dynamic short-time traffic flow forecast system with Sparse is divided for the indifference opposite sex
CN102332153B (en) Kernel regression-based image compression sensing reconstruction method
CN105044794B (en) A kind of compression method and device of nuclear magnetic resonance echo data
CN106529721A (en) Advertisement click-through rate predication system based on deep characteristic extraction and predication method thereof
CN105956089A (en) Recommendation method capable of aiming at classification information with items
CN104298999B (en) EO-1 hyperion feature learning method based on recurrence autocoding
CN105279964A (en) Road network traffic data completion method based on low-order algorithm
CN105893331A (en) Principal component analysis algorithm based compression method for data on road traffic time series
CN109086926A (en) A kind of track traffic for passenger flow prediction technique in short-term based on combination neural net structure
Lee et al. The sparsity and activation analysis of compressed CNN networks in a HW CNN accelerator model
CN105469601A (en) A road traffic space data compression method based on LZW coding
CN105184297A (en) Polarized SAR image classification method based on tensor and sparse self-coder
CN114662807A (en) Multi-scale region photovoltaic output prediction method and system based on sequence coding reconstruction
CN110260914B (en) Engineering safety monitoring system region division method based on measuring point space-time characteristics
CN105427583B (en) A kind of highway traffic data compression method encoded based on LZW
CN103345503B (en) A kind of silk product personalized recommendation method based on wavelet network
CN114444584A (en) Informmer model improvement method and long sequence time sequence prediction method and system
CN112798888B (en) Non-invasive fault diagnosis method for vehicle-mounted electrical system of unmanned train
Wang et al. Fractal image coding using SSIM
CN117333497A (en) Mask supervision strategy-based three-dimensional medical image segmentation method for efficient modeling
CN111914060A (en) Merchant multi-view feature extraction and model construction method based on online comment data
CN116546219A (en) Point cloud geometric color joint compression method based on learning

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