Transformer tracking always takes paired template and search images as encoder input and conduct feature extraction and target‐search feature correlation by self and/or cross attention operations,thus the model compl...
详细信息
Transformer tracking always takes paired template and search images as encoder input and conduct feature extraction and target‐search feature correlation by self and/or cross attention operations,thus the model complexity will grow quadratically with the number of input *** alleviate the burden of this tracking paradigm and facilitate practical deployment of Transformer‐based trackers,we propose a dual pooling transformer tracking framework,dubbed as DPT,which consists of three components:a simple yet efficient spatiotemporal attention model(SAM),a mutual correlation pooling Trans-former(MCPT)and a multiscale aggregation pooling Transformer(MAPT).SAM is designed to gracefully aggregates temporal dynamics and spatial appearance information of multi‐frame templates along space‐time *** aims to capture multi‐scale pooled and correlated contextual features,which is followed by MAPT that aggregates multi‐scale features into a unified feature representation for tracking *** tracker achieves AUC score of 69.5 on LaSOT and precision score of 82.8 on Track-ingNet while maintaining a shorter sequence length of attention tokens,fewer parameters and FLOPs compared to existing state‐of‐the‐art(SOTA)Transformer tracking *** experiments demonstrate that DPT tracker yields a strong real‐time tracking baseline with a good trade‐off between tracking performance and inference efficiency.
Image hashing is a crucial technique for content authentication and image retrieval in various applications, including multimedia databases and copyright protection. This study introduces a novel approach to image has...
详细信息
The optimisation of control engineering tools based on digital twin capabilities and other cyber-physical metaverse manufacturing system (CPMMS) components are crucial for the successful performance. This study propos...
详细信息
We consider a setting in which N agents aim to speedup a common Stochastic Approximation (SA) problem by acting in parallel and communicating with a central server. We assume that the up-link transmissions to the serv...
详细信息
ISBN:
(数字)9798350316339
ISBN:
(纸本)9798350316346
We consider a setting in which N agents aim to speedup a common Stochastic Approximation (SA) problem by acting in parallel and communicating with a central server. We assume that the up-link transmissions to the server are subject to asynchronous and potentially unbounded time-varying delays. To mitigate the effect of delays and stragglers while reaping the benefits of distributed computation, we propose DASA, a Delay-Adaptive algorithm for multi-agent Stochastic Approximation. We provide a finite-time analysis of DASA assuming that the agents’ stochastic observation processes are independent Markov chains. Significantly advancing existing results, DASA is the first algorithm whose convergence rate depends only on the mixing time $\tau_{m i x}$ and on the average delay $\tau_{a v g}$ while jointly achieving an N-fold convergence speedup under Markovian sampling. Our work is relevant for various SA applications, including multi-agent and distributed temporal difference (TD) learning, Q-learning and stochastic optimization with correlated data.
Visual computing is vital for numerous applications. In conventional visual computing systems, CMOS image sensors (CIS) act as pure imaging devices for capturing images, however, recent CIS designs increasingly integr...
详细信息
Estimating high-dimensional covariance matrices is crucial in various domains. This work considers a scenario where two collaborating agents access disjoint dimensions of m samples from a high-dimensional random vecto...
详细信息
Estimating high-dimensional covariance matrices is crucial in various domains. This work considers a scenario where two collaborating agents access disjoint dimensions of m samples from a high-dimensional random vector, and they can only communicate a limited number of bits to a central server, which wants to accurately approximate the covariance matrix. We analyze the fundamental trade-off between communication cost, number of samples, and estimation accuracy. We prove a lower bound on the error achievable by any estimator, highlighting the impact of dimensions, number of samples, and communication budget. Furthermore, we present an algorithm that achieves this lower bound up to a logarithmic factor, demonstrating its near-optimality in practical settings. Copyright 2024 by the author(s)
The study analyses and offers the active blended learning methodology oriented on the students belonging to the so-called Generation Z (Gen Z). The goal is to support achieving the creativity, innovation, and other ta...
详细信息
Generalized Approximate Message Passing (GAMP) allows for Bayesian inference in linear models with non-identically independently distributed (n.i.i.d.) priors and n.i.i.d. measurements of the linear mixture outputs. I...
IoT has been introduced to improve production efficiency in small and medium-sized manufacturing companies, and it is mainly aimed at measuring machinery statuses. The improvement of changeover time is significant for...
详细信息
Tomato plants are vulnerable to several diseases, each of which may cause severe harm to the plant. These adverse conditions can significantly reduce the amount and quality of agricultural yields. In crop disease diag...
详细信息
暂无评论