Equivalence of Correlation Filter and Convolution Filter in Visual Tracking

• URL: http://arxiv.org/abs/2105.00158v2
• Date: Tue, 4 May 2021 11:19:00 GMT
• Title: Equivalence of Correlation Filter and Convolution Filter in Visual Tracking
• Authors: Shuiwang Li, Qijun Zhao, Ziliang Feng, Li Lu
• Abstract summary: Correlation filter has been successfully applied to visual tracking. convolution filter is usually used for blurring, sharpening, embossing, edge detection, etc in image processing.
• Score: 10.820122999766713
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: (Discriminative) Correlation Filter has been successfully applied to visual tracking and has advanced the field significantly in recent years. Correlation filter-based trackers consider visual tracking as a problem of matching the feature template of the object and candidate regions in the detection sample, in which correlation filter provides the means to calculate the similarities. In contrast, convolution filter is usually used for blurring, sharpening, embossing, edge detection, etc in image processing. On the surface, correlation filter and convolution filter are usually used for different purposes. In this paper, however, we proves, for the first time, that correlation filter and convolution filter are equivalent in the sense that their minimum mean-square errors (MMSEs) in visual tracking are equal, under the condition that the optimal solutions exist and the ideal filter response is Gaussian and centrosymmetric. This result gives researchers the freedom to choose correlation or convolution in formulating their trackers. It also suggests that the explanation of the ideal response in terms of similarities is not essential.

Related papers

• Implicit Maximum a Posteriori Filtering via Adaptive Optimization [4.767884267554628]
  We frame the standard Bayesian filtering problem as optimization over a time-varying objective. We show that our framework results in filters that are effective, robust, and scalable to high-dimensional systems.
  arXiv  Detail & Related papers  (2023-11-17T15:30:44Z)
• Computational Doob's h-transforms for Online Filtering of Discretely Observed Diffusions [65.74069050283998]
  We propose a computational framework to approximate Doob's $h$-transforms. The proposed approach can be orders of magnitude more efficient than state-of-the-art particle filters.
  arXiv  Detail & Related papers  (2022-06-07T15:03:05Z)
• Sparse Regularized Correlation Filter for UAV Object Tracking with adaptive Contextual Learning and Keyfilter Selection [20.786475337107472]
  correlation filter has been widely applied in unmanned aerial vehicle (UAV) tracking. It is fragile because of two inherent defects, i.e. boundary effect and filter corruption. We propose a novel $ell_1$ regularization correlation filter with adaptive contextual learning and keyfilter selection.
  arXiv  Detail & Related papers  (2022-05-07T10:25:56Z)
• Fourier Series Expansion Based Filter Parametrization for Equivariant Convolutions [73.33133942934018]
  2D filter parametrization technique plays an important role when designing equivariant convolutions. New equivariant convolution method based on the proposed filter parametrization method, named F-Conv. F-Conv evidently outperforms previous filter parametrization based method in image super-resolution task.
  arXiv  Detail & Related papers  (2021-07-30T10:01:52Z)
• Training Compact CNNs for Image Classification using Dynamic-coded Filter Fusion [139.71852076031962]
  We present a novel filter pruning method, dubbed dynamic-coded filter fusion (DCFF) We derive compact CNNs in a computation-economical and regularization-free manner for efficient image classification. Our DCFF derives a compact VGGNet-16 with only 72.77M FLOPs and 1.06M parameters while reaching top-1 accuracy of 93.47%.
  arXiv  Detail & Related papers  (2021-07-14T18:07:38Z)
• Deep Convolutional Correlation Iterative Particle Filter for Visual Tracking [1.1531505895603305]
  This work proposes a novel framework for visual tracking based on the integration of an iterative particle filter, a deep convolutional neural network, and a correlation filter. We employ a novel strategy to assess the likelihood of the particles after the iterations by applying K-means clustering. Experimental results on two different benchmark datasets show that our tracker performs favorably against state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-07-07T02:44:43Z)
• Dilated filters for edge detection algorithms [0.0]
  Dilated convolution have impressive results in machine learning. We discuss here the idea of dilating the standard filters which are used in edge detection algorithms.
  arXiv  Detail & Related papers  (2021-06-14T12:52:17Z)
• Unsharp Mask Guided Filtering [53.14430987860308]
  The goal of this paper is guided image filtering, which emphasizes the importance of structure transfer during filtering. We propose a new and simplified formulation of the guided filter inspired by unsharp masking. Our formulation enjoys a filtering prior to a low-pass filter and enables explicit structure transfer by estimating a single coefficient.
  arXiv  Detail & Related papers  (2021-06-02T19:15:34Z)
• Efficient Spatially Adaptive Convolution and Correlation [11.167305713900074]
  We provide a representation-theoretic framework that allows for spatially varying linear transformations to be applied to the filter. This framework allows for efficient implementation of extended convolution and correlation for transformation groups such as rotation (in 2D and 3D) and scale. We present applications to pattern matching, image feature description, vector field visualization, and adaptive image filtering.
  arXiv  Detail & Related papers  (2020-06-23T17:41:10Z)
• Dependency Aware Filter Pruning [74.69495455411987]
  Pruning a proportion of unimportant filters is an efficient way to mitigate the inference cost. Previous work prunes filters according to their weight norms or the corresponding batch-norm scaling factors. We propose a novel mechanism to dynamically control the sparsity-inducing regularization so as to achieve the desired sparsity.
  arXiv  Detail & Related papers  (2020-05-06T07:41:22Z)
• Filter Grafting for Deep Neural Networks: Reason, Method, and Cultivation [86.91324735966766]
  Filter is the key component in modern convolutional neural networks (CNNs) In this paper, we introduce filter grafting (textbfMethod) to achieve this goal. We develop a novel criterion to measure the information of filters and an adaptive weighting strategy to balance the grafted information among networks.
  arXiv  Detail & Related papers  (2020-04-26T08:36:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.