In the study of oriented bounding boxes(OBB)object detection in high-resolution remote sensing images,the problem of missed and wrong detection of small targets occurs because the targets are too small and have differ...In the study of oriented bounding boxes(OBB)object detection in high-resolution remote sensing images,the problem of missed and wrong detection of small targets occurs because the targets are too small and have different orientations.Existing OBB object detection for remote sensing images,although making good progress,mainly focuses on directional modeling,while less consideration is given to the size of the object as well as the problem of missed detection.In this study,a method based on improved YOLOv8 was proposed for detecting oriented objects in remote sensing images,which can improve the detection precision of oriented objects in remote sensing images.Firstly,the ResCBAMG module was innovatively designed,which could better extract channel and spatial correlation information.Secondly,the innovative top-down feature fusion layer network structure was proposed in conjunction with the Efficient Channel Attention(ECA)attention module,which helped to capture inter-local cross-channel interaction information appropriately.Finally,we introduced an innovative ResCBAMG module between the different C2f modules and detection heads of the bottom-up feature fusion layer.This innovative structure helped the model to better focus on the target area.The precision and robustness of oriented target detection were also improved.Experimental results on the DOTA-v1.5 dataset showed that the detection Precision,mAP@0.5,and mAP@0.5:0.95 metrics of the improved model are better compared to the original model.This improvement is effective in detecting small targets and complex scenes.展开更多
在Bounding-box及其改进方法研究中,普遍采用正方形的重叠区域的质心作为定位的结果,然而该正方形与实际无线传感器节点的通信区域模型之间存在较大差异,导致定位误差较大。针对此问题,提出一种改进的Bounding-box定位方法。该方法在定...在Bounding-box及其改进方法研究中,普遍采用正方形的重叠区域的质心作为定位的结果,然而该正方形与实际无线传感器节点的通信区域模型之间存在较大差异,导致定位误差较大。针对此问题,提出一种改进的Bounding-box定位方法。该方法在定位时,不再采用正方形的通信区域模型,而是采用圆形的通信区域模型进行定位。基于仿真数据以及采用3种典型通信环境下真实的到达信号强度指示(received signal strength indicator,RSSI)数据完成定位实验,实验结果表明,该方法具有较高的定位精度,因此具有一定的实际应用价值。展开更多
根据煤矿井下人员精确定位系统对实时性和定位精度的要求,提出了基于TOF(time of flight,飞行时间)的Bounding-Box二次定位算法,该算法综合了TOF测距不易受环境干扰和Bounding-Box计算实时性高的优点。利用待定位节点与参考节点测距获...根据煤矿井下人员精确定位系统对实时性和定位精度的要求,提出了基于TOF(time of flight,飞行时间)的Bounding-Box二次定位算法,该算法综合了TOF测距不易受环境干扰和Bounding-Box计算实时性高的优点。利用待定位节点与参考节点测距获得距离,并利用Bounding-Box得到初始区域位置信息后,再将周围已定位的节点考虑进去,并再次利用Bounding-Box算法进行二次定位,缩小未知节点所在的区域,最终获得位置信息。实验结果表明,该算法实时性高,并且能够提高定位精度。展开更多
Congestion is a dynamic phenomenon and hence efficiently computing alternate shortest route can only help expedite decongestion. This research is aimed to efficiently compute shortest path for road traffic network so ...Congestion is a dynamic phenomenon and hence efficiently computing alternate shortest route can only help expedite decongestion. This research is aimed to efficiently compute shortest path for road traffic network so that congestion can be eased resulting in reduced CO2 emission and improved economy. Congestion detection is achieved after evaluating road capacity and road occupancy. Congestion index, a ratio of road occupancy to road capacity is computed, congestion index higher than 0.6 necessitates computation of alternate shortest route. Various algorithms offer shortest alternate route. The paper discusses minimization of graph based by removing redundant nodes which don’t play a role in computation of shortest path. The proposal is based on continuous definition of a bounding box every time a next neighboring node is considered. This reduces maximum number of contentious nodes repeatedly and optimizes the network. The algorithm is deployed from both the ends sequentially to ensure zero error and validate the shortest path discovery. While discovering shortest path, the algorithm also offers an array of shortest path in ascending order of the path length. However, vehicular traffic exhibits network duality viz. static and dynamic network graphs. Shortest route for static distance graph is pre-computed and stored for look-up, alternate shortest path based on assignment of congestion levels to edge weights is triggered by congestion index. The research also supports directed graphs to address traffic rules for lanes having unidirectional and bidirectional traffic.展开更多
This paper proposes a pedestrian tracking approach using bounding box based on probability densities.It is generally a difficult task to track features like corner points in outdoor images due to complex environment.T...This paper proposes a pedestrian tracking approach using bounding box based on probability densities.It is generally a difficult task to track features like corner points in outdoor images due to complex environment.To solve this problem,the feature points are projected along X and Y direction separately,and a histogram is constructed for each projection,with horizontal axis as positions and vertical axis as the number of feature points that lie on each position.Finally,the vertical axis is normalized for expression as probability.After histogram is constructed,the probability of each feature point is checked with a threshold.A feature point will be ignored if its probability is lower than a threshold,while the remaining feature points are grouped,based on which a bounding box is made.Kanade-Lucas Tomasi(KLT)algorithm is adopted as the tracking algorithm because it is able to track local features in images robustly.The efficiency of the tracking results using this method is verified in real environment test.展开更多
We present the best bounds on the distance between 3-direction quartic box spline surface patch and its control net by means of analysis and computing for the basis functions of 3-direction quartic box spline surface....We present the best bounds on the distance between 3-direction quartic box spline surface patch and its control net by means of analysis and computing for the basis functions of 3-direction quartic box spline surface.Both the local bounds and the global bounds are given by the maximum norm of the first differences or second differences or mixed differences of the control points of the surface patch.展开更多
We know that the Box dimension of f（x） ∈ C^1[0,1] is 1. In this paper, we prove that the Box dimension of continuous functions with bounded variation is still 1. Furthermore, Box dimension of Weyl fractional integr...We know that the Box dimension of f（x） ∈ C^1[0,1] is 1. In this paper, we prove that the Box dimension of continuous functions with bounded variation is still 1. Furthermore, Box dimension of Weyl fractional integral of above function is also 1.展开更多
文摘In the study of oriented bounding boxes(OBB)object detection in high-resolution remote sensing images,the problem of missed and wrong detection of small targets occurs because the targets are too small and have different orientations.Existing OBB object detection for remote sensing images,although making good progress,mainly focuses on directional modeling,while less consideration is given to the size of the object as well as the problem of missed detection.In this study,a method based on improved YOLOv8 was proposed for detecting oriented objects in remote sensing images,which can improve the detection precision of oriented objects in remote sensing images.Firstly,the ResCBAMG module was innovatively designed,which could better extract channel and spatial correlation information.Secondly,the innovative top-down feature fusion layer network structure was proposed in conjunction with the Efficient Channel Attention(ECA)attention module,which helped to capture inter-local cross-channel interaction information appropriately.Finally,we introduced an innovative ResCBAMG module between the different C2f modules and detection heads of the bottom-up feature fusion layer.This innovative structure helped the model to better focus on the target area.The precision and robustness of oriented target detection were also improved.Experimental results on the DOTA-v1.5 dataset showed that the detection Precision,mAP@0.5,and mAP@0.5:0.95 metrics of the improved model are better compared to the original model.This improvement is effective in detecting small targets and complex scenes.
文摘在Bounding-box及其改进方法研究中,普遍采用正方形的重叠区域的质心作为定位的结果,然而该正方形与实际无线传感器节点的通信区域模型之间存在较大差异,导致定位误差较大。针对此问题,提出一种改进的Bounding-box定位方法。该方法在定位时,不再采用正方形的通信区域模型,而是采用圆形的通信区域模型进行定位。基于仿真数据以及采用3种典型通信环境下真实的到达信号强度指示(received signal strength indicator,RSSI)数据完成定位实验,实验结果表明,该方法具有较高的定位精度,因此具有一定的实际应用价值。
文摘根据煤矿井下人员精确定位系统对实时性和定位精度的要求,提出了基于TOF(time of flight,飞行时间)的Bounding-Box二次定位算法,该算法综合了TOF测距不易受环境干扰和Bounding-Box计算实时性高的优点。利用待定位节点与参考节点测距获得距离,并利用Bounding-Box得到初始区域位置信息后,再将周围已定位的节点考虑进去,并再次利用Bounding-Box算法进行二次定位,缩小未知节点所在的区域,最终获得位置信息。实验结果表明,该算法实时性高,并且能够提高定位精度。
文摘Congestion is a dynamic phenomenon and hence efficiently computing alternate shortest route can only help expedite decongestion. This research is aimed to efficiently compute shortest path for road traffic network so that congestion can be eased resulting in reduced CO2 emission and improved economy. Congestion detection is achieved after evaluating road capacity and road occupancy. Congestion index, a ratio of road occupancy to road capacity is computed, congestion index higher than 0.6 necessitates computation of alternate shortest route. Various algorithms offer shortest alternate route. The paper discusses minimization of graph based by removing redundant nodes which don’t play a role in computation of shortest path. The proposal is based on continuous definition of a bounding box every time a next neighboring node is considered. This reduces maximum number of contentious nodes repeatedly and optimizes the network. The algorithm is deployed from both the ends sequentially to ensure zero error and validate the shortest path discovery. While discovering shortest path, the algorithm also offers an array of shortest path in ascending order of the path length. However, vehicular traffic exhibits network duality viz. static and dynamic network graphs. Shortest route for static distance graph is pre-computed and stored for look-up, alternate shortest path based on assignment of congestion levels to edge weights is triggered by congestion index. The research also supports directed graphs to address traffic rules for lanes having unidirectional and bidirectional traffic.
基金the MKE(The Ministry of Knowledge Economy),Korea,under the ITRC(Infor mation Technology Research Center)support program supervised by the NIPA(National IT Industry Promotion Agency)(NIPA-2012-H0301-12-2006)The Brain Korea 21 Project in 2012
文摘This paper proposes a pedestrian tracking approach using bounding box based on probability densities.It is generally a difficult task to track features like corner points in outdoor images due to complex environment.To solve this problem,the feature points are projected along X and Y direction separately,and a histogram is constructed for each projection,with horizontal axis as positions and vertical axis as the number of feature points that lie on each position.Finally,the vertical axis is normalized for expression as probability.After histogram is constructed,the probability of each feature point is checked with a threshold.A feature point will be ignored if its probability is lower than a threshold,while the remaining feature points are grouped,based on which a bounding box is made.Kanade-Lucas Tomasi(KLT)algorithm is adopted as the tracking algorithm because it is able to track local features in images robustly.The efficiency of the tracking results using this method is verified in real environment test.
基金Supported by the National Natural Science Foundation of China (61170324 and 61100105)
文摘We present the best bounds on the distance between 3-direction quartic box spline surface patch and its control net by means of analysis and computing for the basis functions of 3-direction quartic box spline surface.Both the local bounds and the global bounds are given by the maximum norm of the first differences or second differences or mixed differences of the control points of the surface patch.
文摘We know that the Box dimension of f（x） ∈ C^1[0,1] is 1. In this paper, we prove that the Box dimension of continuous functions with bounded variation is still 1. Furthermore, Box dimension of Weyl fractional integral of above function is also 1.
