Search Results (7)

Recognizing traffic signs is crucial for autonomous driving systems, as it significantly impacts their safety and dependability. However, challenges like the diminutive size of objects and intricate background environments limit the effectiveness of current object detection models. To improve small traffic sign detection, this research introduces an enhanced detection algorithm built on YOLOv10. First, a custom-designed layer for detecting small objects is integrated into the neck section of the network, enhancing the feature extraction process for these objects. Second, a refined downsampling module, called Triple-Branch Downsampling (TBD), utilizes a multi-branch structure and hybrid pooling strategy to boost feature extraction efficiency within the model. Finally, the loss function is optimized by integrating the Normalized Wasserstein Distance (NWD) and Wise-MPDIoU mechanisms, increasing the accuracy of bounding box matching and regression. The experimental findings indicate that the enhanced algorithm reaches a mAP@0.5 of 84.8%, marking a 4% increase over YOLOv10. The classification accuracy and recall are 73.4% and 82.9%, respectively. Moreover, the parameter count decreases by approximately 10%, while the computational complexity is reduced by around 5%. Full article

Recently, there has been renewed interest in signed distance bound representations due to their unique properties for 3D shape modelling. This is especially the case for deep learning-based bounds. However, it is beneficial to work with polygons in most computer graphics applications. Thus, in this paper, we introduce and investigate an asymptotically fast method for transforming signed distance bounds into polygon meshes. This is achieved by combining the principles of sphere tracing (or ray marching) with traditional polygonization techniques, such as marching cubes. We provide theoretical and experimental evidence that this approach is of the $O(N^{2}logN)$ computational complexity for a polygonization grid with $N^3$ cells. The algorithm is tested on both a set of primitive shapes and signed distance bounds generated from point clouds by machine learning (and represented as neural networks). Given its speed, implementation simplicity, and portability, we argue that it could prove useful during the modelling stage as well as in shape compression for storage. Full article

The Hubble tension in cosmology is not showing signs of alleviation and thus, it is important to look for alternative approaches to it. One such example would be the eventual detection of a time delay between simultaneously emitted high-energy and low-energy photons in gamma-ray bursts (GRB). This would signal a possible Lorentz Invariance Violation (LIV) and in the case of non-zero quantum gravity time delay, it can be used to study cosmology as well. In this work, we use various astrophysical datasets (BAO, Pantheon Plus and the CMB distance priors), combined with two GRB time delay datasets with their respective models for the intrinsic time delay. Since the intrinsic time delay is considered the largest source of uncertainty in such studies, finding a better model is important. Our results yield as quantum gravity energy bound $E_{QG}\ge {10}^{17}$ GeV and $E_{QG}\ge {10}^{18}$ GeV respectively. The difference between standard approximation (constant intrinsic lag) and the extended (non-constant) approximations is minimal in most cases we conside. However, the biggest effect on the results comes from the prior on the parameter $\frac{c}{H_0{r}_d}$, emphasizing once again that at current precision, cosmological datasets are the dominant factor in determining the cosmology. We estimate the energies at which cosmology gets significantly affected by the time delay dataset. Full article

Traffic sign detection is an essential component of an intelligent transportation system, since it provides critical road traffic data for vehicle decision-making and control. To solve the challenges of small traffic signs, inconspicuous characteristics, and low detection accuracy, a traffic sign recognition method based on improved (You Only Look Once v3) YOLOv3 is proposed. The spatial pyramid pooling structure is fused into the YOLOv3 network structure to achieve the fusion of local features and global features, and the fourth feature prediction scale of 152 × 152 size is introduced to make full use of the shallow features in the network to predict small targets. Furthermore, the bounding box regression is more stable when the distance-IoU (DIoU) loss is used, which takes into account the distance between the target and anchor, the overlap rate, and the scale. The Tsinghua–Tencent 100K (TT100K) traffic sign dataset’s 12 anchors are recalculated using the K-means clustering algorithm, while the dataset is balanced and expanded to address the problem of an uneven number of target classes in the TT100K dataset. The algorithm is compared to YOLOv3 and other commonly used target detection algorithms, and the results show that the improved YOLOv3 algorithm achieves a mean average precision (mAP) of 77.3%, which is 8.4% higher than YOLOv3, especially in small target detection, where the mAP is improved by 10.5%, greatly improving the accuracy of the detection network while keeping the real-time performance as high as possible. The detection network’s accuracy is substantially enhanced while keeping the network’s real-time performance as high as possible. Full article

This article proposes a two-stage simultaneous localization and mapping (SLAM) method based on using the red green blue-depth (RGB-D) camera in dynamic environments, which can not only improve tracking robustness and trajectory accuracy but also reconstruct a clean and dense static background model in dynamic environments. In the first stage, to accurately exclude the interference of features in the dynamic region from the tracking, the dynamic object mask is extracted by Mask-RCNN and optimized by using the connected component analysis method and a reference frame-based method. Then, the feature points, lines, and planes in the nondynamic object area are used to construct an optimization model to improve the tracking accuracy and robustness. After the tracking is completed, the mask is further optimized by the multiview projection method. In the second stage, to accurately obtain the pending area, which contains the dynamic object area and the newly added area in each frame, a method is proposed, which is based on a ray-casting algorithm and fully uses the result of the first stage. To extract the static region from the pending region, this paper designs divisible and indivisible regions process methods and the bounding box tracking method. Then, the extracted static regions are merged into the map using the truncated signed distance function method. Finally, the clean static background model is obtained. Our methods have been verified on public datasets and real scenes. The results show that the presented methods achieve comparable or better trajectory accuracy and the best robustness, and can construct a clean static background model in a dynamic scene. Full article

The wheel-legged hybrid robot (WLHR) is capable of adapting height and wheelbase configuration to traverse obstacles or rolling in confined space. Compared with legged and wheeled machines, it can be applied for more challenging mobile robotic exercises using the enhanced environment adapting performance. To make full use of the deformability and traversability of WHLR with parallel Stewart mechanism, this paper presents an optimization-driven planning framework for WHLR with parallel Stewart mechanism by abstracting the robot as a deformable bounding box. It will improve the obstacle negotiation ability of the high degree-of-freedoms robot, resulting in a shorter path through adjusting wheelbase of support polygon or trunk height instead of using a fixed configuration for wheeled robots. In the planning framework, we firstly proposed a pre-calculated signed distance field (SDF) mapping method based on point cloud data collected from a lidar sensor and a KD -tree-based point cloud fusion approach. Then, a covariant gradient optimization method is presented, which generates smooth, deformable-configuration, as well as collision-free trajectories in confined narrow spaces. Finally, with the user-defined driving velocity and position as motion inputs, obstacle-avoidancing actions including expanding or shrinking foothold polygon and lifting trunk were effectively testified in realistic conditions, demonstrating the practicability of our methodology. We analyzed the success rate of proposed framework in four different terrain scenarios through deforming configuration rather than bypassing obstacles. Full article

Real-time dense mapping systems have been developed since the birth of consumer RGB-D cameras. Currently, there are two commonly used models in dense mapping systems: truncated signed distance function (TSDF) and surfel. The state-of-the-art dense mapping systems usually work fine with small-sized regions. The generated dense surface may be unsatisfactory around the loop closures when the system tracking drift grows large. In addition, the efficiency of the system with surfel model slows down when the number of the model points in the map becomes large. In this paper, we propose to use two maps in the dense mapping system. The RGB-D images are integrated into a local surfel map. The old surfels that reconstructed in former times and far away from the camera frustum are moved from the local map to the global map. The updated surfels in the local map when every frame arrives are kept bounded. Therefore, in our system, the scene that can be reconstructed is very large, and the frame rate of our system remains high. We detect loop closures and optimize the pose graph to distribute system tracking drift. The positions and normals of the surfels in the map are also corrected using an embedded deformation graph so that they are consistent with the updated poses. In order to deal with large surface deformations, we propose a new method for constructing constraints with system trajectories and loop closure keyframes. The proposed new method stabilizes large-scale surface deformation. Experimental results show that our novel system behaves better than the prior state-of-the-art dense mapping systems. Full article