Reinforced Background Aware Correlation Filter with Adaptive Weighting Strategy for RGB-T Tracking

Author(s):  
Xin Zeng ◽  
Zhongqiang Luo ◽  
Xingzhong Xiong
2005 ◽  
Vol 53 (5) ◽  
pp. 1858-1862 ◽  
Author(s):  
E. Bort ◽  
M. Donelli ◽  
A. Martini ◽  
A. Massa

2021 ◽  
Vol 11 (23) ◽  
pp. 11192
Author(s):  
Xiaoxu Yang ◽  
Jie Liu ◽  
Yi Liu ◽  
Peng Xu ◽  
Ling Yu ◽  
...  

Aiming at the problems of the basic sparrow search algorithm (SSA) in terms of slow convergence speed and the ease of falling into the local optimum, the chaotic mapping strategy, adaptive weighting strategy and t-distribution mutation strategy are introduced to develop a novel adaptive sparrow search algorithm, namely the CWTSSA in this paper. In the proposed CWTSSA, the chaotic mapping strategy is employed to initialize the population in order to enhance the population diversity. The adaptive weighting strategy is applied to balance the capabilities of local mining and global exploration, and improve the convergence speed. An adaptive t-distribution mutation operator is designed, which uses the iteration number t as the degree of freedom parameter of the t-distribution to improve the characteristic of global exploration and local exploration abilities, so as to avoid falling into the local optimum. In order to prove the effectiveness of the CWTSSA, 15 standard test functions and other improved SSAs, differential evolution (DE), particle swarm optimization (PSO), gray wolf optimization (GWO) are selected here. The compared experiment results indicate that the proposed CWTSSA can obtain higher convergence accuracy, faster convergence speed, better diversity and exploration abilities. It provides a new optimization algorithm for solving complex optimization problems.


2019 ◽  
Vol 31 (5) ◽  
pp. 792
Author(s):  
Zongmin Li ◽  
Hongjiao Fu ◽  
Yujie Liu ◽  
Hua Li

Electronics ◽  
2021 ◽  
Vol 10 (3) ◽  
pp. 348
Author(s):  
Choongsang Cho ◽  
Young Han Lee ◽  
Jongyoul Park ◽  
Sangkeun Lee

Semantic image segmentation has a wide range of applications. When it comes to medical image segmentation, its accuracy is even more important than those of other areas because the performance gives useful information directly applicable to disease diagnosis, surgical planning, and history monitoring. The state-of-the-art models in medical image segmentation are variants of encoder-decoder architecture, which is called U-Net. To effectively reflect the spatial features in feature maps in encoder-decoder architecture, we propose a spatially adaptive weighting scheme for medical image segmentation. Specifically, the spatial feature is estimated from the feature maps, and the learned weighting parameters are obtained from the computed map, since segmentation results are predicted from the feature map through a convolutional layer. Especially in the proposed networks, the convolutional block for extracting the feature map is replaced with the widely used convolutional frameworks: VGG, ResNet, and Bottleneck Resent structures. In addition, a bilinear up-sampling method replaces the up-convolutional layer to increase the resolution of the feature map. For the performance evaluation of the proposed architecture, we used three data sets covering different medical imaging modalities. Experimental results show that the network with the proposed self-spatial adaptive weighting block based on the ResNet framework gave the highest IoU and DICE scores in the three tasks compared to other methods. In particular, the segmentation network combining the proposed self-spatially adaptive block and ResNet framework recorded the highest 3.01% and 2.89% improvements in IoU and DICE scores, respectively, in the Nerve data set. Therefore, we believe that the proposed scheme can be a useful tool for image segmentation tasks based on the encoder-decoder architecture.


Sign in / Sign up

Export Citation Format

Share Document