We propose a 6D pose estimation method that introduces an edge attention mechanism into the bidirectional feature fusion network. Our method constructs an end-to-end network model by sharing weights between the edge detection encoder and the encoder of the RGB branch in the feature fusion network, effectively utilizing edge information and improving the accuracy and robustness of 6D pose estimation. Experimental results show that this method achieves an accuracy of nearly 100% on the LineMOD dataset, and it also achieves state-of-the-art performance on the YCB-V dataset, especially on objects with significant edge information.

The consistency between the semantic information provided by the multi-modal reference and the tracked object is crucial for visual-language (VL) tracking. However, existing VL tracking frameworks rely on static multi-modal references to locate dynamic objects, which can lead to semantic discrepancies and reduce the robustness of the tracker. To address this issue, we propose a novel vision-language tracking framework, named DUTrack, which captures the latest state of the target by dynamically updating multi-modal references to maintain consistency. Specifically, we introduce a Dynamic Language Update Module, which leverages a large language model to generate dynamic language descriptions for the object based on visual features and object category information. Then, we design a Dynamic Template Capture Module, which captures the regions in the image that highly match the dynamic language descriptions. Furthermore, to ensure the efficiency of description generation, we design an update strategy that assesses changes in target displacement, scale, and other factors to decide on updates. Finally, the dynamic template and language descriptions that record the latest state of the target are used to update the multi-modal references, providing more accurate reference information for subsequent inference and enhancing the robustness of the tracker. DUTrack achieves new state-of-the-art performance on four mainstream vision-language and two vision-only tracking benchmarks, including LaSOT, LaSOT$_{\rm{ext}}$, TNL2K, OTB99-Lang, GOT-10K, and UAV123. Code and models are available at https://github.com/GXNU-ZhongLab/DUTrack.

R-tree is an important multi-dimensional data structure widely employed in many applications for storing and querying spatial data. As GPUs emerge as powerful computing hardware platforms, a GPU-based parallel R-tree becomes the key to efficiently port R-tree-related applications to GPUs. However, traditional tree-based data structures can hardly be directly ported to GPUs, and it is also a great challenge to develop highly efficient parallel tree-based data structures on GPUs. The difficulty mostly lies in the design of tree-based data structures and related operations in the context of many-core architecture that can facilitate parallel processing. We summarize our contributions as follows: (i) design a GPU-friendly data structure to store spatial data; (ii) present two parallel R-tree construction algorithms and one parallel R-tree query algorithm that can take the hardware characteristics of GPUs into consideration; and (iii) port the vector map overlay system from CPU to GPU to demonstrate the feasibility of parallel R-tree. Experimental results show that our parallel R-tree on GPU is efficient and practical. Compared with the traditional CPU-based sequential vector map overlay system, our vector map overlay system based on parallel R-tree can achieve nearly 10-fold speedup.

With the rapid evolution of social computing, online sentiments have become valuable information for analyzing the latent structure of social networks. Sentiment leaders in social networks are those who bring in new information, ideas, and innovations, disseminate them to the masses, and thus influence the opinions and sentiment of others. Identifying sentiment leaders can help businesses predict marketing campaigns, adjust marketing strategies, maintain their partnerships, and improve their products’ reputations. However, capturing the complex sentiment dynamics from multi-hop interactions and trust/distrust relationships, as well as identifying leaders within sentiment-aligned communities while maximizing sentiment spread efficiently through both direct and indirect paths, is a significant challenge to be addressed. This paper pioneers a challenging and important problem of sentiment leader identification in social networks. To this end, we propose an original solution framework called “SentiRank” and develop the associated algorithms to identify sentiment leaders. SentiRank contains three key technical steps: (1) constructing a sentiment graph from a social network; (2) detecting sentiment communities; (3) ranking the nodes on the selected sentiment communities to identify sentiment leaders. Extensive experimental results based on the real-world datasets demonstrate that the proposed framework and algorithms outperform the existing algorithms in terms of both one-step sentiment coverage and all-path sentiment coverage. Furthermore, the proposed algorithm performs around 6.5 times better than the random approach in terms of sentiment coverage maximization.