With the rapid advancement of social economies,intelligent transportation systems are gaining increasing atten-tion.Central to these systems is the detection of abnormal vehicle behavior,which remains a critical chall...With the rapid advancement of social economies,intelligent transportation systems are gaining increasing atten-tion.Central to these systems is the detection of abnormal vehicle behavior,which remains a critical challenge due to the complexity of urban roadways and the variability of external conditions.Current research on detecting abnormal traffic behaviors is still nascent,with significant room for improvement in recognition accuracy.To address this,this research has developed a new model for recognizing abnormal traffic behaviors.This model employs the R3D network as its core architecture,incorporating a dense block to facilitate feature reuse.This approach not only enhances performance with fewer parameters and reduced computational demands but also allows for the acquisition of new features while simplifying the overall network structure.Additionally,this research integrates a self-attentive method that dynamically adjusts to the prevailing traffic conditions,optimizing the relevance of features for the task at hand.For temporal analysis,a Bi-LSTM layer is utilized to extract and learn from time-based data nuances.This research conducted a series of comparative experiments using the UCF-Crime dataset,achieving a notable accuracy of 89.30%on our test set.Our results demonstrate that our model not only operates with fewer parameters but also achieves superior recognition accuracy compared to previous models.展开更多
Matrix completion is the extension of compressed sensing.In compressed sensing,we solve the underdetermined equations using sparsity prior of the unknown signals.However,in matrix completion,we solve the underdetermin...Matrix completion is the extension of compressed sensing.In compressed sensing,we solve the underdetermined equations using sparsity prior of the unknown signals.However,in matrix completion,we solve the underdetermined equations based on sparsity prior in singular values set of the unknown matrix,which also calls low-rank prior of the unknown matrix.This paper firstly introduces basic concept of matrix completion,analyses the matrix suitably used in matrix completion,and shows that such matrix should satisfy two conditions:low rank and incoherence property.Then the paper provides three reconstruction algorithms commonly used in matrix completion:singular value thresholding algorithm,singular value projection,and atomic decomposition for minimum rank approximation,puts forward their shortcoming to know the rank of original matrix.The Projected Gradient Descent based on Soft Thresholding(STPGD),proposed in this paper predicts the rank of unknown matrix using soft thresholding,and iteratives based on projected gradient descent,thus it could estimate the rank of unknown matrix exactly with low computational complexity,this is verified by numerical experiments.We also analyze the convergence and computational complexity of the STPGD algorithm,point out this algorithm is guaranteed to converge,and analyse the number of iterations needed to reach reconstruction error.Compared the computational complexity of the STPGD algorithm to other algorithms,we draw the conclusion that the STPGD algorithm not only reduces the computational complexity,but also improves the precision of the reconstruction solution.展开更多
In this paper,we address the problem of multiple frequency-hopping(FH)signal parameters estimation in the presence of random missing observations.A space-time matrix with random missing observations is acquired by a u...In this paper,we address the problem of multiple frequency-hopping(FH)signal parameters estimation in the presence of random missing observations.A space-time matrix with random missing observations is acquired by a uniform linear array(ULA).We exploit the inherent incomplete data processing capability of atomic norm soft thresholding(AST)to analyze the space-time matrix and complete the accurate estimation of the hopping time and frequency of the received FH signals.The hopping time is obtained by the sudden changes of the spatial information,which is implemented as the boundary to divide the time domain signal so that each segment of the signal is a superposition of time-invariant multiple components.Then,the frequency of multiple signal components can be estimated precisely by AST within each segment.After obtaining the above two parameters of the hopping time and the frequency of signals,the direction of arrival(DOA)can be directly calculated by them,and the network sorting can be realized.Results of simulation show that the proposed method is superior to the existing technology.Even when a large portion of data observations is missing,as the number of array elements increases,the proposed method still achieves acceptable accuracy of multi-FH signal parameters estimation.展开更多
Gyro＇s drift is not only the main drift error which influences gyro＇s precision but also the primary factor that affects gyro＇s reliability. Reducing zero drift and random drift is a key problem to the output of a ...Gyro＇s drift is not only the main drift error which influences gyro＇s precision but also the primary factor that affects gyro＇s reliability. Reducing zero drift and random drift is a key problem to the output of a gyro signal. A three-layer de-nosing threshold algorithm is proposed based on the wavelet decomposition to dispose the signal which is collected from a running fiber optic gyro （FOG）. The coefficients are obtained from the three-layer wavelet packet decomposition. By setting the high frequency part which is greater than wavelet packet threshold as zero, then reconstructing the nodes which have been filtered out noise and interruption, the soft threshold function is constructed by the coefficients of the third nodes. Compared wavelet packet de-noise with forced de-noising method, the proposed method is more effective. Simulation results show that the random drift compensation is enhanced by 13.1%, and reduces zero drift by 0.052 6°/h.展开更多
基金supported by the National Natural Science Foundation of China(61971007&61571013).
文摘With the rapid advancement of social economies,intelligent transportation systems are gaining increasing atten-tion.Central to these systems is the detection of abnormal vehicle behavior,which remains a critical challenge due to the complexity of urban roadways and the variability of external conditions.Current research on detecting abnormal traffic behaviors is still nascent,with significant room for improvement in recognition accuracy.To address this,this research has developed a new model for recognizing abnormal traffic behaviors.This model employs the R3D network as its core architecture,incorporating a dense block to facilitate feature reuse.This approach not only enhances performance with fewer parameters and reduced computational demands but also allows for the acquisition of new features while simplifying the overall network structure.Additionally,this research integrates a self-attentive method that dynamically adjusts to the prevailing traffic conditions,optimizing the relevance of features for the task at hand.For temporal analysis,a Bi-LSTM layer is utilized to extract and learn from time-based data nuances.This research conducted a series of comparative experiments using the UCF-Crime dataset,achieving a notable accuracy of 89.30%on our test set.Our results demonstrate that our model not only operates with fewer parameters but also achieves superior recognition accuracy compared to previous models.
基金Supported by the National Natural Science Foundation ofChina(No.61271240)Jiangsu Province Natural Science Fund Project(No.BK2010077)Subject of Twelfth Five Years Plans in Jiangsu Second Normal University(No.417103)
文摘Matrix completion is the extension of compressed sensing.In compressed sensing,we solve the underdetermined equations using sparsity prior of the unknown signals.However,in matrix completion,we solve the underdetermined equations based on sparsity prior in singular values set of the unknown matrix,which also calls low-rank prior of the unknown matrix.This paper firstly introduces basic concept of matrix completion,analyses the matrix suitably used in matrix completion,and shows that such matrix should satisfy two conditions:low rank and incoherence property.Then the paper provides three reconstruction algorithms commonly used in matrix completion:singular value thresholding algorithm,singular value projection,and atomic decomposition for minimum rank approximation,puts forward their shortcoming to know the rank of original matrix.The Projected Gradient Descent based on Soft Thresholding(STPGD),proposed in this paper predicts the rank of unknown matrix using soft thresholding,and iteratives based on projected gradient descent,thus it could estimate the rank of unknown matrix exactly with low computational complexity,this is verified by numerical experiments.We also analyze the convergence and computational complexity of the STPGD algorithm,point out this algorithm is guaranteed to converge,and analyse the number of iterations needed to reach reconstruction error.Compared the computational complexity of the STPGD algorithm to other algorithms,we draw the conclusion that the STPGD algorithm not only reduces the computational complexity,but also improves the precision of the reconstruction solution.
文摘In this paper,we address the problem of multiple frequency-hopping(FH)signal parameters estimation in the presence of random missing observations.A space-time matrix with random missing observations is acquired by a uniform linear array(ULA).We exploit the inherent incomplete data processing capability of atomic norm soft thresholding(AST)to analyze the space-time matrix and complete the accurate estimation of the hopping time and frequency of the received FH signals.The hopping time is obtained by the sudden changes of the spatial information,which is implemented as the boundary to divide the time domain signal so that each segment of the signal is a superposition of time-invariant multiple components.Then,the frequency of multiple signal components can be estimated precisely by AST within each segment.After obtaining the above two parameters of the hopping time and the frequency of signals,the direction of arrival(DOA)can be directly calculated by them,and the network sorting can be realized.Results of simulation show that the proposed method is superior to the existing technology.Even when a large portion of data observations is missing,as the number of array elements increases,the proposed method still achieves acceptable accuracy of multi-FH signal parameters estimation.
文摘Gyro＇s drift is not only the main drift error which influences gyro＇s precision but also the primary factor that affects gyro＇s reliability. Reducing zero drift and random drift is a key problem to the output of a gyro signal. A three-layer de-nosing threshold algorithm is proposed based on the wavelet decomposition to dispose the signal which is collected from a running fiber optic gyro （FOG）. The coefficients are obtained from the three-layer wavelet packet decomposition. By setting the high frequency part which is greater than wavelet packet threshold as zero, then reconstructing the nodes which have been filtered out noise and interruption, the soft threshold function is constructed by the coefficients of the third nodes. Compared wavelet packet de-noise with forced de-noising method, the proposed method is more effective. Simulation results show that the random drift compensation is enhanced by 13.1%, and reduces zero drift by 0.052 6°/h.
