Fixed-point fast sweeping methods are a class of explicit iterative methods developed in the literature to efficiently solve steady-state solutions of hyperbolic partial differential equations(PDEs).As other types of ...Fixed-point fast sweeping methods are a class of explicit iterative methods developed in the literature to efficiently solve steady-state solutions of hyperbolic partial differential equations(PDEs).As other types of fast sweeping schemes,fixed-point fast sweeping methods use the Gauss-Seidel iterations and alternating sweeping strategy to cover characteristics of hyperbolic PDEs in a certain direction simultaneously in each sweeping order.The resulting iterative schemes have a fast convergence rate to steady-state solutions.Moreover,an advantage of fixed-point fast sweeping methods over other types of fast sweeping methods is that they are explicit and do not involve the inverse operation of any nonlinear local system.Hence,they are robust and flexible,and have been combined with high-order accurate weighted essentially non-oscillatory(WENO)schemes to solve various hyperbolic PDEs in the literature.For multidimensional nonlinear problems,high-order fixed-point fast sweeping WENO methods still require quite a large amount of computational costs.In this technical note,we apply sparse-grid techniques,an effective approximation tool for multidimensional problems,to fixed-point fast sweeping WENO methods for reducing their computational costs.Here,we focus on fixed-point fast sweeping WENO schemes with third-order accuracy(Zhang et al.2006[41]),for solving Eikonal equations,an important class of static Hamilton-Jacobi(H-J)equations.Numerical experiments on solving multidimensional Eikonal equations and a more general static H-J equation are performed to show that the sparse-grid computations of the fixed-point fast sweeping WENO schemes achieve large savings of CPU times on refined meshes,and at the same time maintain comparable accuracy and resolution with those on corresponding regular single grids.展开更多
Most research on anomaly detection has focused on event that is different from its spatial-temporal neighboring events.It is still a significant challenge to detect anomalies that involve multiple normal events intera...Most research on anomaly detection has focused on event that is different from its spatial-temporal neighboring events.It is still a significant challenge to detect anomalies that involve multiple normal events interacting in an unusual pattern.In this work,a novel unsupervised method based on sparse topic model was proposed to capture motion patterns and detect anomalies in traffic surveillance.scale-invariant feature transform(SIFT)flow was used to improve the dense trajectory in order to extract interest points and the corresponding descriptors with less interference.For the purpose of strengthening the relationship of interest points on the same trajectory,the fisher kernel method was applied to obtain the representation of trajectory which was quantized into visual word.Then the sparse topic model was proposed to explore the latent motion patterns and achieve a sparse representation for the video scene.Finally,two anomaly detection algorithms were compared based on video clip detection and visual word analysis respectively.Experiments were conducted on QMUL Junction dataset and AVSS dataset.The results demonstrated the superior efficiency of the proposed method.展开更多
A new method for interaction recognition based on sparse representation of feature covariance matrices was presented.Firstly,the dense trajectories(DT)extracted from the video were clustered into different groups to e...A new method for interaction recognition based on sparse representation of feature covariance matrices was presented.Firstly,the dense trajectories(DT)extracted from the video were clustered into different groups to eliminate the irrelevant trajectories,which could greatly reduce the noise influence on feature extraction.Then,the trajectory tunnels were characterized by means of feature covariance matrices.In this way,the discriminative descriptors could be extracted,which was also an effective solution to the problem that the description of the feature second-order statistics is insufficient.After that,an over-complete dictionary was learned with the descriptors and all the descriptors were encoded using sparse coding(SC).Classification was achieved using multiple instance learning(MIL),which was more suitable for complex environments.The proposed method was tested and evaluated on the WEB Interaction dataset and the UT interaction dataset.The experimental results demonstrated the superior efficiency.展开更多
Sparse trajectory data with non-second-by-second sampling intervals are common.However,most carbon emission estimation models for vehicles require second-bysecond inputs.Additionally,some models ignore the emission ge...Sparse trajectory data with non-second-by-second sampling intervals are common.However,most carbon emission estimation models for vehicles require second-bysecond inputs.Additionally,some models ignore the emission generation principle,and some have complicated inputs.To address these limitations,this study proposes a vehicle carbon emission estimation method for urban traffic,based on sparse trajectory data.First,a trajectory reconstruction method based on interpolation of acceleration distribution is proposed.The results showed that the reconstructed trajectory was close to the real trajectory,and the accuracy was 2%-17%higher than that of other methods.Second,a carbon emission estimation model that considers both the emission generation principle and feasibility is proposed.The model with a goodness-of-fit of 0.887 had the best performance compared to the other models.The emission estimation results of the reconstructed sparse trajectories showed that the precision improved significantly for data with different frequencies compared to that of other reconstruction methods,e.g.,9%higher at a 30 s sampling interval.展开更多
针对场景扫描深度图数据量大、匹配误差累积导致重建结果漂移以及耗时高的问题,提出一种场景级目标的稀疏序列融合三维扫描重建方法.首先,对深度图序列采样以筛选支撑深度图;其次,在支撑深度图子集上划分扫描片段,各扫描片段内执行深度...针对场景扫描深度图数据量大、匹配误差累积导致重建结果漂移以及耗时高的问题,提出一种场景级目标的稀疏序列融合三维扫描重建方法.首先,对深度图序列采样以筛选支撑深度图;其次,在支撑深度图子集上划分扫描片段,各扫描片段内执行深度图匹配融合生成表面片段;再次,利用表面片段几何特征执行局部多片段间的连续迭代配准,优化各扫描片段的相机位姿;最后,融合支撑深度图序列生成场景目标三维表面.在消费级深度相机采集的深度图序列和SceneNN与Stanford 3D Scene这2个公开数据集上进行测试,将稀疏序列融合与稠密序列融合方法进行比较.实验结果表明,该方法可将配准过程的均方根误差降低16%~28%,使用8%~54%的数据量即可完成稀疏序列融合,运行时间平均缩短56%;同时,增强了扫描过程的有效性和鲁棒性,显著地提高了扫描场景的重建质量.展开更多
文摘Fixed-point fast sweeping methods are a class of explicit iterative methods developed in the literature to efficiently solve steady-state solutions of hyperbolic partial differential equations(PDEs).As other types of fast sweeping schemes,fixed-point fast sweeping methods use the Gauss-Seidel iterations and alternating sweeping strategy to cover characteristics of hyperbolic PDEs in a certain direction simultaneously in each sweeping order.The resulting iterative schemes have a fast convergence rate to steady-state solutions.Moreover,an advantage of fixed-point fast sweeping methods over other types of fast sweeping methods is that they are explicit and do not involve the inverse operation of any nonlinear local system.Hence,they are robust and flexible,and have been combined with high-order accurate weighted essentially non-oscillatory(WENO)schemes to solve various hyperbolic PDEs in the literature.For multidimensional nonlinear problems,high-order fixed-point fast sweeping WENO methods still require quite a large amount of computational costs.In this technical note,we apply sparse-grid techniques,an effective approximation tool for multidimensional problems,to fixed-point fast sweeping WENO methods for reducing their computational costs.Here,we focus on fixed-point fast sweeping WENO schemes with third-order accuracy(Zhang et al.2006[41]),for solving Eikonal equations,an important class of static Hamilton-Jacobi(H-J)equations.Numerical experiments on solving multidimensional Eikonal equations and a more general static H-J equation are performed to show that the sparse-grid computations of the fixed-point fast sweeping WENO schemes achieve large savings of CPU times on refined meshes,and at the same time maintain comparable accuracy and resolution with those on corresponding regular single grids.
基金Project(50808025)supported by the National Natural Science Foundation of ChinaProject(20090162110057)supported by the Doctoral Fund of Ministry of Education,China
文摘Most research on anomaly detection has focused on event that is different from its spatial-temporal neighboring events.It is still a significant challenge to detect anomalies that involve multiple normal events interacting in an unusual pattern.In this work,a novel unsupervised method based on sparse topic model was proposed to capture motion patterns and detect anomalies in traffic surveillance.scale-invariant feature transform(SIFT)flow was used to improve the dense trajectory in order to extract interest points and the corresponding descriptors with less interference.For the purpose of strengthening the relationship of interest points on the same trajectory,the fisher kernel method was applied to obtain the representation of trajectory which was quantized into visual word.Then the sparse topic model was proposed to explore the latent motion patterns and achieve a sparse representation for the video scene.Finally,two anomaly detection algorithms were compared based on video clip detection and visual word analysis respectively.Experiments were conducted on QMUL Junction dataset and AVSS dataset.The results demonstrated the superior efficiency of the proposed method.
基金Project(51678075) supported by the National Natural Science Foundation of ChinaProject(2017GK2271) supported by the Science and Technology Project of Hunan Province,China
文摘A new method for interaction recognition based on sparse representation of feature covariance matrices was presented.Firstly,the dense trajectories(DT)extracted from the video were clustered into different groups to eliminate the irrelevant trajectories,which could greatly reduce the noise influence on feature extraction.Then,the trajectory tunnels were characterized by means of feature covariance matrices.In this way,the discriminative descriptors could be extracted,which was also an effective solution to the problem that the description of the feature second-order statistics is insufficient.After that,an over-complete dictionary was learned with the descriptors and all the descriptors were encoded using sparse coding(SC).Classification was achieved using multiple instance learning(MIL),which was more suitable for complex environments.The proposed method was tested and evaluated on the WEB Interaction dataset and the UT interaction dataset.The experimental results demonstrated the superior efficiency.
基金supported by the National Natural Science Foundation of China(No.52131204,52325210,and 52102415)the Fundamental Research Funds for the Central Universities(2023-4-YB-05).
文摘Sparse trajectory data with non-second-by-second sampling intervals are common.However,most carbon emission estimation models for vehicles require second-bysecond inputs.Additionally,some models ignore the emission generation principle,and some have complicated inputs.To address these limitations,this study proposes a vehicle carbon emission estimation method for urban traffic,based on sparse trajectory data.First,a trajectory reconstruction method based on interpolation of acceleration distribution is proposed.The results showed that the reconstructed trajectory was close to the real trajectory,and the accuracy was 2%-17%higher than that of other methods.Second,a carbon emission estimation model that considers both the emission generation principle and feasibility is proposed.The model with a goodness-of-fit of 0.887 had the best performance compared to the other models.The emission estimation results of the reconstructed sparse trajectories showed that the precision improved significantly for data with different frequencies compared to that of other reconstruction methods,e.g.,9%higher at a 30 s sampling interval.
文摘针对场景扫描深度图数据量大、匹配误差累积导致重建结果漂移以及耗时高的问题,提出一种场景级目标的稀疏序列融合三维扫描重建方法.首先,对深度图序列采样以筛选支撑深度图;其次,在支撑深度图子集上划分扫描片段,各扫描片段内执行深度图匹配融合生成表面片段;再次,利用表面片段几何特征执行局部多片段间的连续迭代配准,优化各扫描片段的相机位姿;最后,融合支撑深度图序列生成场景目标三维表面.在消费级深度相机采集的深度图序列和SceneNN与Stanford 3D Scene这2个公开数据集上进行测试,将稀疏序列融合与稠密序列融合方法进行比较.实验结果表明,该方法可将配准过程的均方根误差降低16%~28%,使用8%~54%的数据量即可完成稀疏序列融合,运行时间平均缩短56%;同时,增强了扫描过程的有效性和鲁棒性,显著地提高了扫描场景的重建质量.
