公路上固定相机拍摄的视频中背景难以自动更新、运动目标难以快速准确识别和车流密度难以快速获得的问题,提出了一种车流密度实时检测算法。首先,将统计直方图法和多帧平均法相结合,提出固定窗口背景自动更新算法来获得视频的背景图像;...公路上固定相机拍摄的视频中背景难以自动更新、运动目标难以快速准确识别和车流密度难以快速获得的问题,提出了一种车流密度实时检测算法。首先,将统计直方图法和多帧平均法相结合,提出固定窗口背景自动更新算法来获得视频的背景图像;其次,使用背景差分法获得前景区域、前景掩码和背景区域;第三,使用腐蚀和膨胀的方法去除微小区域,以及将较大区域内部的空白点进行填充;第四,提出使用行扫描标记算法获得运动目标的最大矩轮廓,并消除运动目标的部分阴影;最后,根据设定阈值过滤掉微小目标,统计瞬时车流量,并根据预设值计算车流密度。该系统使用Visual Studio 2010和Open CV实现,实时效果良好。展开更多
An optimal measurement pose number searching method was designed to improve the pose selection method.Several optimal robot measurement configurations were added to an initial pre-selected optimal configuration set to...An optimal measurement pose number searching method was designed to improve the pose selection method.Several optimal robot measurement configurations were added to an initial pre-selected optimal configuration set to establish a new configuration set for robot calibration one by one.The root mean squares (RMS) of the errors of each end-effector poses after being calibrated by these configuration sets were calculated.The optimal number of the configuration set corresponding to the least RMS of pose error was then obtained.Calibration based on those poses selected by this algorithm can get higher end-effector accuracy,meanwhile consumes less time.An optimal pose set including optimal 25 measurement configurations is found during the simulation.Tracking errors after calibration by using these poses are 1.54,1.61 and 0.86 mm,and better than those before calibration which are 7.79,7.62 and 8.29 mm,even better than those calibrated by the random method which are 2.22,2.35 and 1.69 mm in directions X,Y and Z,respectively.展开更多
Perceptual auditory filter banks such as Bark-scale filter bank are widely used as front-end processing in speech recognition systems.However,the problem of the design of optimized filter banks that provide higher acc...Perceptual auditory filter banks such as Bark-scale filter bank are widely used as front-end processing in speech recognition systems.However,the problem of the design of optimized filter banks that provide higher accuracy in recognition tasks is still open.Owing to spectral analysis in feature extraction,an adaptive bands filter bank (ABFB) is presented.The design adopts flexible bandwidths and center frequencies for the frequency responses of the filters and utilizes genetic algorithm (GA) to optimize the design parameters.The optimization process is realized by combining the front-end filter bank with the back-end recognition network in the performance evaluation loop.The deployment of ABFB together with zero-crossing peak amplitude (ZCPA) feature as a front process for radial basis function (RBF) system shows significant improvement in robustness compared with the Bark-scale filter bank.In ABFB,several sub-bands are still more concentrated toward lower frequency but their exact locations are determined by the performance rather than the perceptual criteria.For the ease of optimization,only symmetrical bands are considered here,which still provide satisfactory results.展开更多
To effectively solve the traffic data problems such as data invalidation in the process of the acquisition of road traffic states,a road traffic states estimation algorithm based on matching of the regional traffic at...To effectively solve the traffic data problems such as data invalidation in the process of the acquisition of road traffic states,a road traffic states estimation algorithm based on matching of the regional traffic attracters was proposed in this work.First of all,the road traffic running states were divided into several different modes.The concept of the regional traffic attracters of the target link was put forward for effective matching.Then,the reference sequences of characteristics of traffic running states with the contents of the target link's traffic running states and regional traffic attracters under different modes were established.In addition,the current and historical regional traffic attracters of the target link were matched through certain matching rules,and the historical traffic running states of the target link corresponding to the optimal matching were selected as the initial recovery data,which were processed with Kalman filter to obtain the final recovery data.Finally,some typical expressways in Beijing were adopted for the verification of this road traffic states estimation algorithm.The results prove that this traffic states estimation approach based on matching of the regional traffic attracters is feasible and can achieve a high accuracy.展开更多
Too high energy consumption is widely recognized to be a critical problem in large-scale parallel computing systems.The LogP-based energy-saving model and the frequency scaling method were proposed to reduce energy co...Too high energy consumption is widely recognized to be a critical problem in large-scale parallel computing systems.The LogP-based energy-saving model and the frequency scaling method were proposed to reduce energy consumption analytically and systematically for other two representative barrier algorithms:tournament barrier and central counter barrier.Furthermore,energy optimization methods of these two barrier algorithms were implemented on parallel computing platform.The experimental results validate the effectiveness of the energy optimization methods.67.12% and 70.95% energy savings are obtained respectively for tournament barrier and central counter barrier on platforms with 2048 processes with 1.55%?8.80% performance loss.Furthermore,LogP-based energy-saving analytical model for these two barrier algorithms is highly accurate as the predicted energy savings are within 9.67% of the results obtained by simulation.展开更多
Two popular traditional join algorithms and their parallel versions are introduced. When designing join algorithms in serial computing environment, decomposing inner relation is considered as the right direction to sa...Two popular traditional join algorithms and their parallel versions are introduced. When designing join algorithms in serial computing environment, decomposing inner relation is considered as the right direction to save disk I/Os. However, two different decomposition algorithms are compared, such as inner vs. outer decomposition first algorithms for tuple-based and block-based nested loop joins, showing that the proposed approach is 20% better than general approach. Also lemmas are proved, when we have to use the outer decomposition first parallel join algorithms.展开更多
文摘公路上固定相机拍摄的视频中背景难以自动更新、运动目标难以快速准确识别和车流密度难以快速获得的问题,提出了一种车流密度实时检测算法。首先,将统计直方图法和多帧平均法相结合,提出固定窗口背景自动更新算法来获得视频的背景图像;其次,使用背景差分法获得前景区域、前景掩码和背景区域;第三,使用腐蚀和膨胀的方法去除微小区域,以及将较大区域内部的空白点进行填充;第四,提出使用行扫描标记算法获得运动目标的最大矩轮廓,并消除运动目标的部分阴影;最后,根据设定阈值过滤掉微小目标,统计瞬时车流量,并根据预设值计算车流密度。该系统使用Visual Studio 2010和Open CV实现,实时效果良好。
基金Project(2008AA04Z203) supported by the National High Technology Research and Development Program of China
文摘An optimal measurement pose number searching method was designed to improve the pose selection method.Several optimal robot measurement configurations were added to an initial pre-selected optimal configuration set to establish a new configuration set for robot calibration one by one.The root mean squares (RMS) of the errors of each end-effector poses after being calibrated by these configuration sets were calculated.The optimal number of the configuration set corresponding to the least RMS of pose error was then obtained.Calibration based on those poses selected by this algorithm can get higher end-effector accuracy,meanwhile consumes less time.An optimal pose set including optimal 25 measurement configurations is found during the simulation.Tracking errors after calibration by using these poses are 1.54,1.61 and 0.86 mm,and better than those before calibration which are 7.79,7.62 and 8.29 mm,even better than those calibrated by the random method which are 2.22,2.35 and 1.69 mm in directions X,Y and Z,respectively.
基金Project(61072087) supported by the National Natural Science Foundation of ChinaProject(20093048) supported by Shanxi ProvincialGraduate Innovation Fund of China
文摘Perceptual auditory filter banks such as Bark-scale filter bank are widely used as front-end processing in speech recognition systems.However,the problem of the design of optimized filter banks that provide higher accuracy in recognition tasks is still open.Owing to spectral analysis in feature extraction,an adaptive bands filter bank (ABFB) is presented.The design adopts flexible bandwidths and center frequencies for the frequency responses of the filters and utilizes genetic algorithm (GA) to optimize the design parameters.The optimization process is realized by combining the front-end filter bank with the back-end recognition network in the performance evaluation loop.The deployment of ABFB together with zero-crossing peak amplitude (ZCPA) feature as a front process for radial basis function (RBF) system shows significant improvement in robustness compared with the Bark-scale filter bank.In ABFB,several sub-bands are still more concentrated toward lower frequency but their exact locations are determined by the performance rather than the perceptual criteria.For the ease of optimization,only symmetrical bands are considered here,which still provide satisfactory results.
基金Projects(D07020601400707,D101106049710005)supported by the Beijing Science Foundation Plan Project,ChinaProjects(2006AA11Z231,2012AA112401)supported by the National High Technology Research and Development Program of China(863 Program)Project(61104164)supported by the National Natural Science Foundation of China
文摘To effectively solve the traffic data problems such as data invalidation in the process of the acquisition of road traffic states,a road traffic states estimation algorithm based on matching of the regional traffic attracters was proposed in this work.First of all,the road traffic running states were divided into several different modes.The concept of the regional traffic attracters of the target link was put forward for effective matching.Then,the reference sequences of characteristics of traffic running states with the contents of the target link's traffic running states and regional traffic attracters under different modes were established.In addition,the current and historical regional traffic attracters of the target link were matched through certain matching rules,and the historical traffic running states of the target link corresponding to the optimal matching were selected as the initial recovery data,which were processed with Kalman filter to obtain the final recovery data.Finally,some typical expressways in Beijing were adopted for the verification of this road traffic states estimation algorithm.The results prove that this traffic states estimation approach based on matching of the regional traffic attracters is feasible and can achieve a high accuracy.
基金Projects(60903044,61170049) supported by National Natural Science Foundation of China
文摘Too high energy consumption is widely recognized to be a critical problem in large-scale parallel computing systems.The LogP-based energy-saving model and the frequency scaling method were proposed to reduce energy consumption analytically and systematically for other two representative barrier algorithms:tournament barrier and central counter barrier.Furthermore,energy optimization methods of these two barrier algorithms were implemented on parallel computing platform.The experimental results validate the effectiveness of the energy optimization methods.67.12% and 70.95% energy savings are obtained respectively for tournament barrier and central counter barrier on platforms with 2048 processes with 1.55%?8.80% performance loss.Furthermore,LogP-based energy-saving analytical model for these two barrier algorithms is highly accurate as the predicted energy savings are within 9.67% of the results obtained by simulation.
基金supported by the National Research Foundation (NRF) of Korea through contract N-14-NMIR06
文摘Two popular traditional join algorithms and their parallel versions are introduced. When designing join algorithms in serial computing environment, decomposing inner relation is considered as the right direction to save disk I/Os. However, two different decomposition algorithms are compared, such as inner vs. outer decomposition first algorithms for tuple-based and block-based nested loop joins, showing that the proposed approach is 20% better than general approach. Also lemmas are proved, when we have to use the outer decomposition first parallel join algorithms.
